Vertex-based and edge-based centroids of graphs. - Yongxin Lan; Tao Li 022; Yuede Ma; Yongtang Shi; Hua Wang 003 (Appl. Math. Comput., 2018)

Analyzing lattice networks through substructures. - Hui Lei 002; Tao Li 022; Yuede Ma; Hua Wang 003 (Appl. Math. Comput., 2018)

Nordhaus-Gaddum type results for graph irregularities. - Yuede Ma; Shujuan Cao; Yongtang Shi; Matthias Dehmer; Chengyi Xia (Appl. Math. Comput., 2019)

Integer linear programming models for the weighted total domination problem. - Yuede Ma; Qingqiong Cai; Shunyu Yao 005 (Appl. Math. Comput., 2019)

A note on rainbow saturation number of paths. - Shujuan Cao; Yuede Ma; Zhenyu Taoqiu (Appl. Math. Comput., 2020)

Relationships between symmetry-based graph measures. - Yuede Ma; Matthias Dehmer; Urs-Martin Künzi; Abbe Mowshowitz; Shailesh Tripathi; Modjtaba Ghorbani; Frank Emmert-Streib (Inf. Sci., 2021)

The usefulness of topological indices. - Yuede Ma; Matthias Dehmer; Urs-Martin Künzi; Shailesh Tripathi; Modjtaba Ghorbani; Jin Tao; Frank Emmert-Streib (Inf. Sci., 2022)

Note on the anti-Ramsey number for matching in hypercubes. - Rui Li; Yuede Ma; Zhongmei Qin; Yingping Zhao (Appl. Math. Comput., 2025)