Formally self-dual linear binary codes from circulant graphs. - Ruihu Li; Xueliang Li 001; Yaping Mao; Meiqin Wei (CoRR, 2014)

Additive codes over $GF(4)$ from circulant graphs. - Ruihu Li; Xueliang Li 001; Yaping Mao; Meiqin Wei (CoRR, 2014)

Searching for (near) Optimal Codes. - Xueliang Li 001; Yaping Mao; Meiqin Wei; Ruihu Li (COCOA, 2015)

Novel inequalities for generalized graph entropies - Graph energies and topological indices. - Xueliang Li 001; Zhongmei Qin; Meiqin Wei; Ivan Gutman; Matthias Dehmer (Appl. Math. Comput., 2015)

A survey of recent results in (generalized) graph entropies. - Xueliang Li 001; Meiqin Wei (CoRR, 2015)

Proper connection number and connected dominating sets. - Xueliang Li 001; Meiqin Wei; Jun Yue (Theor. Comput. Sci., 2015)

Coupon coloring of some special graphs. - Yongtang Shi; Meiqin Wei; Jun Yue; Yan Zhao 013 (J. Comb. Optim., 2017)

On the double Roman domination of graphs. - Jun Yue; Meiqin Wei; Min Li 028; Guodong Liu (Appl. Math. Comput., 2018)

Generalized rainbow connection of graphs and their complements. - Xueliang Li 001; Colton Magnant; Meiqin Wei; Xiaoyu Zhu (Discuss. Math. Graph Theory, 2018)

The annihilation number and the total domination number of a tree-like graph. - Jun Yue; Yiping Zhu; Meiqin Wei (Appl. Math. Comput., 2020)

Gallai-Ramsey numbers for rainbow P5 and monochromatic fans or wheels. - Meiqin Wei; Changxiang He; Yaping Mao; Xiangqian Zhou (Discret. Math., 2022)

The effect of vertex and edge deletion on the edge metric dimension of graphs. - Meiqin Wei; Jun Yue; Lily Chen (J. Comb. Optim., 2022)

A many-objective optimization algorithm using a two-space interactive evolutionary framework. - Tianyu Liu; Wang Zhu 003; Meiqin Wei (Swarm Evol. Comput., 2022)

Ramsey and Gallai-Ramsey numbers for the union of paths and stars. - Jiannan Zhou; Zhihui Li; Yaping Mao; Meiqin Wei (Discret. Appl. Math., 2023)

Complete bipartite graphs without small rainbow stars. - Weizhen Chen; Meng Ji; Yaping Mao; Meiqin Wei (Discret. Appl. Math., 2023)

Complete bipartite graphs without small rainbow subgraphs. - Zhiqiang Ma; Yaping Mao; Ingo Schiermeyer; Meiqin Wei (Discret. Appl. Math., 2024)

Sufficient Conditions of (Isolated) Toughness and Binding Number for the Existence of Component Factors. - Zhiqiang Ma; Fengyun Ren; Meiqin Wei; Gemaji Bao (J. Interconnect. Networks, 2024)

Ramsey and Gallai-Ramsey numbers for comb and sun graphs. - Xiao Xu; Meiqin Wei; Hong-Jian Lai; Yaping Mao (Discret. Appl. Math., 2025)

Ramsey and Gallai-Ramsey numbers for forests. - Yujia Gao; Meng Ji; Yaping Mao; Meiqin Wei (Discuss. Math. Graph Theory, 2025)

The edge metric dimensions of convex polytopes. - Meiqin Wei; Bohua Fan; Changhong Lu; Jun Yue; Jinfeng Liu (Discret. Appl. Math., 2026)