Vulnerability of super edge-connected networks. - Zhen-Mu Hong; Jun-Ming Xu 001 (Theor. Comput. Sci., 2014)

The Signless Laplacian or Adjacency Spectral Radius of Bicyclic Graphs with Given Number of Cut Edges. - Zhen-Mu Hong; Yi-Zheng Fan (Graphs Comb., 2015)

Parity Subgraphs with Few Common Edges and Nowhere-Zero 5-Flow. - Jiaao Li; Xinmin Hou; Zhen-Mu Hong; Xiaofeng Ding (Graphs Comb., 2015)

A note on broom number and maximum edge-cut of graphs. - Zhen-Mu Hong; Xinmin Hou; Jiaao Li; Yang Yang (Ars Comb., 2017)

Maximum Detour-Harary Index for Some Graph Classes. - Wei Fang; Wei-Hua Liu; Jia-Bao Liu; Fu-Yuan Chen; Zhen-Mu Hong; Zheng-Jiang Xia (Symmetry, 2018)

Sufficient Conditions for Graphs to Be k -Connected, Maximally Connected, and Super-Connected. - Zhen-Mu Hong; Zheng-Jiang Xia; Fu-Yuan Chen; Lutz Volkmann (Complex., 2021)

The Optimal Rubbling Number of Paths, Cycles, and Grids. - Zheng-Jiang Xia; Zhen-Mu Hong (Complex., 2021)

Induced subgraphs of product graphs and a generalization of Huang's theorem. - Zhen-Mu Hong; Hong-Jian Lai; Jianbing Liu (J. Graph Theory, 2021)

On injective chromatic index of sparse graphs with maximum degree 5. - Jian Lu; Zhen-Mu Hong; Zheng-Jiang Xia (J. Comb. Optim., 2024)