A kind of conditional fault tolerance of (n, k)-star graphs. - Weihua Yang; Hengzhe Li; Xiaofeng Guo (Inf. Process. Lett., 2010)

Conditional connectivity of Cayley graphs generated by transposition trees. - Weihua Yang; Hengzhe Li; Jixiang Meng (Inf. Process. Lett., 2010)

The (strong) rainbow connection numbers of Cayley graphs on Abelian groups. - Hengzhe Li; Xueliang Li 001; Sujuan Liu (Comput. Math. Appl., 2011)

Rainbow connection of graphs with diameter 2. - Hengzhe Li; Xueliang Li 001; Sujuan Liu (Discret. Math., 2012)

Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees. - Hengzhe Li; Weihua Yang; Jixiang Meng (Discret. Math., 2012)

The generalized 3-connectivity of Cartesian product. - Hengzhe Li; Xueliang Li 001; Yuefang Sun (Discret. Math. Theor. Comput. Sci., 2012)

Note on the generalized connectivity. - Hengzhe Li; Xueliang Li 001; Yaping Mao; Yuefang Sun (Ars Comb., 2014)

The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree. - Weihua Yang; Yingzhi Tian; Hengzhe Li; Hao Li; Xiaofeng Guo (Discret. Appl. Math., 2014)

Oriented diameter and rainbow connection number of a graph. - Xiaolong Huang; Hengzhe Li; Xueliang Li 001; Yuefang Sun (Discret. Math. Theor. Comput. Sci., 2014)

Note on Minimally d-Rainbow Connected Graphs. - Hengzhe Li; Xueliang Li 001; Yuefang Sun; Yan Zhao 013 (Graphs Comb., 2014)

A kind of conditional vertex connectivity of recursive circulants. - Hengzhe Li; Weihua Yang; Jixiang Meng (Ars Comb., 2015)

Note on the spanning-tree packing number of lexicographic product graphs. - Hengzhe Li; Xueliang Li 001; Yaping Mao; Jun Yue (Discret. Math., 2015)

Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees. - Weihua Yang; Hengzhe Li; Wei-Hua He (Int. J. Comput. Math., 2015)

2-Edge connected dominating sets and 2-Connected dominating sets of a graph. - Hengzhe Li; Yuxing Yang; Baoyindureng Wu (J. Comb. Optim., 2016)

Algorithm on rainbow connection for maximal outerplanar graphs. - Xingchao Deng; Hengzhe Li; Guiying Yan (Theor. Comput. Sci., 2016)

The generalized 3-connectivity of graph products. - Hengzhe Li; Yingbin Ma; Weihua Yang; Yifei Wang (Appl. Math. Comput., 2017)

The chromatic equivalence class of graph ψn3(n-3, 1). - Yaping Mao; Chengfu Ye; Hengzhe Li; Shumin Zhang (Ars Comb., 2017)

Rainbow connection number and graph operations. - Hengzhe Li; Yingbin Ma (Discret. Appl. Math., 2017)

Rainbow connection number of graphs with diameter 3. - Xueliang Li 001; Hengzhe Li; Yuefang Sun (Discuss. Math. Graph Theory, 2017)

The λ3-connectivity and κ3-connectivity of recursive circulants. - Hengzhe Li; Jiajia Wang (Appl. Math. Comput., 2018)

Steiner tree packing number and tree connectivity. - Hengzhe Li; Baoyindureng Wu; Jixiang Meng; Yingbin Ma (Discret. Math., 2018)

Making a dominating set of a graph connected. - Hengzhe Li; Baoyindureng Wu; Weihua Yang (Discuss. Math. Graph Theory, 2018)

On the Steiner 4-Diameter of Graphs. - Zhao Wang 007; Yaping Mao; Hengzhe Li; Chengfu Ye (J. Interconnect. Networks, 2018)

The κk-connectivity of line graphs. - Hengzhe Li; Yuanyuan Lu; Baoyindureng Wu; Ankang Wei (Discret. Appl. Math., 2020)

The vertex- rainbow connection number of some graph operations. - Xueliang Li 001; Hengzhe Li; Yingbin Ma (Discuss. Math. Graph Theory, 2021)

Total Rainbow Connection Number of Some Graph Operations. - Hengzhe Li; Yingbin Ma; Yan Zhao 013 (Axioms, 2022)

The generalized 4-connectivity of pancake graphs. - Shu-Li Zhao; Jou-Ming Chang; Hengzhe Li (Discret. Appl. Math., 2023)

Edge-Disjoint Steiner Trees and Connectors in Graphs. - Hengzhe Li; Huayue Liu; Jianbing Liu; Yaping Mao (Graphs Comb., 2023)

2-(Ddge-)Connected Edge Domination Number and Matching Number. - Hengzhe Li; Ankang Wei; Shenggui Zhang (Graphs Comb., 2023)

Synergetic Theory of Information Entropy Based on Failure Approach Index for Stability Analysis of Surrounding Rock System. - Lijun Xiong; Haiping Yuan; Gaoliang Liu; Hengzhe Li; Yangyao Zou; Xiaohu Liu; Xiaoming Li (Entropy, 2023)

The λ4-Connectivity of the Cartesian Product of Trees. - Hengzhe Li; Jiajia Wang; Rong-Xia Hao (J. Interconnect. Networks, 2023)

Addible edges in 2-matching-connected graphs and 3-matching-connected graphs. - Hengzhe Li; Menghan Ma; Jianbing Liu; Xiao Zhao (Discret. Appl. Math., 2024)

On the minimum size of graphs with given generalized connectivity. - Shu-Li Zhao; Hengzhe Li; Jou-Ming Chang (Discret. Appl. Math., 2024)

Synergy Prediction Model of Information Entropy Based on Zone Safety Degree and Stope Roof Weighting Step Analysis. - Lijun Xiong; Haiping Yuan; Hengzhe Li; Xiaohu Liu; Yangyao Zou; Shuaijie Ji; Xingye Fang (Axioms, 2024)

The K1,2-structure-connectivity of graphs. - Xiao Zhao; Haojie Zheng; Hengzhe Li (J. Supercomput., 2024)

The matching-connectivity of a graph. - Hengzhe Li; Menghan Ma; Shuli Zhao; Xiao Zhao; Xiaohui Hua; Yingbin Ma; Hong-Jian Lai (Discret. Appl. Math., 2025)

The structure of 2-matching connected graphs. - Hengzhe Li; Menghan Ma; Shuli Zhao; Jianbing Liu (Discuss. Math. Graph Theory, 2025)

Assessment of peak particle velocity of blast vibration using hybrid soft computing approaches. - Haiping Yuan; Yangyao Zou; Hengzhe Li; Shuaijie Ji; Ziang Gu; Liu He; Ruichao Hu (J. Comput. Des. Eng., 2025)

Complexity and Algorithm for the Matching vertex-cutset Problem. - Hengzhe Li; Qiong Wang; Jianbing Liu; Yanhong Gao (CoRR, 2025)

Classification forecasting research of rock burst intensity based on the BO-XGBoost-Cloud model. - Haiping Yuan; Shuaijie Ji; Hengzhe Li; Chuanqi Zhu; Yangyao Zou; Bin Ni; Ziang Gu (Earth Sci. Informatics, 2025)

Diameter Three Orientability of Mixed Bipartite Graphs. - Hengzhe Li; Zhiwei Ding; Jianbing Liu; An Chang (Graphs Comb., 2025)

Diameter two orientability of mixed graphs. - Hengzhe Li; Zhiwei Ding; Jianbing Liu; Hong-Jian Lai (Discret. Math., 2026)