Hengzhe Li
Orcid: 0000-0002-1132-8410
According to our database1,
Hengzhe Li
authored at least 35 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
J. Supercomput., November, 2024
Synergy Prediction Model of Information Entropy Based on Zone Safety Degree and Stope Roof Weighting Step Analysis.
Axioms, September, 2024
Discret. Appl. Math., 2024
Discret. Appl. Math., 2024
2023
J. Interconnect. Networks, September, 2023
Synergetic Theory of Information Entropy Based on Failure Approach Index for Stability Analysis of Surrounding Rock System.
Entropy, August, 2023
Graphs Comb., April, 2023
2022
2021
Discuss. Math. Graph Theory, 2021
2020
2018
The <i>λ</i><sub>3</sub>-connectivity and <i>κ</i><sub>3</sub>-connectivity of recursive circulants.
Appl. Math. Comput., 2018
2017
Discuss. Math. Graph Theory, 2017
The chromatic equivalence class of graph ψ<sub>n</sub><sup>3</sup>(n-3, 1).
Ars Comb., 2017
2016
Theor. Comput. Sci., 2016
J. Comb. Optim., 2016
2015
Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees.
Int. J. Comput. Math., 2015
Discret. Math., 2015
A kind of conditional vertex connectivity of recursive circulants.
Ars Comb., 2015
2014
Discret. Math. Theor. Comput. Sci., 2014
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree.
Discret. Appl. Math., 2014
Note on the generalized connectivity.
Ars Comb., 2014
2012
Discret. Math. Theor. Comput. Sci., 2012
Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees.
Discret. Math., 2012
2011
Comput. Math. Appl., 2011
2010
Inf. Process. Lett., 2010
Inf. Process. Lett., 2010