Hengzhe Li

Orcid: 0000-0002-1132-8410

According to our database1, Hengzhe Li authored at least 35 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The K<sub>1,2</sub>-structure-connectivity of graphs.
J. Supercomput., November, 2024

Synergy Prediction Model of Information Entropy Based on Zone Safety Degree and Stope Roof Weighting Step Analysis.
Axioms, September, 2024

On the minimum size of graphs with given generalized connectivity.
Discret. Appl. Math., 2024

Addible edges in 2-matching-connected graphs and 3-matching-connected graphs.
Discret. Appl. Math., 2024

2023
The λ4-Connectivity of the Cartesian Product of Trees.
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

2-(Ddge-)Connected Edge Domination Number and Matching Number.
Graphs Comb., April, 2023

Edge-Disjoint Steiner Trees and Connectors in Graphs.
Graphs Comb., April, 2023

The generalized 4-connectivity of pancake graphs.
Discret. Appl. Math., 2023

2022
Total Rainbow Connection Number of Some Graph Operations.
Axioms, 2022

2021
The vertex- rainbow connection number of some graph operations.
Discuss. Math. Graph Theory, 2021

2020
The κk-connectivity of line graphs.
Discret. Appl. Math., 2020

2018
On the Steiner 4-Diameter of Graphs.
J. Interconnect. Networks, 2018

Making a dominating set of a graph connected.
Discuss. Math. Graph Theory, 2018

Steiner tree packing number and tree connectivity.
Discret. Math., 2018

The <i>λ</i><sub>3</sub>-connectivity and <i>κ</i><sub>3</sub>-connectivity of recursive circulants.
Appl. Math. Comput., 2018

2017
Rainbow connection number of graphs with diameter 3.
Discuss. Math. Graph Theory, 2017

Rainbow connection number and graph operations.
Discret. Appl. Math., 2017

The chromatic equivalence class of graph ψ<sub>n</sub><sup>3</sup>(n-3, 1).
Ars Comb., 2017

The generalized 3-connectivity of graph products.
Appl. Math. Comput., 2017

2016
Algorithm on rainbow connection for maximal outerplanar graphs.
Theor. Comput. Sci., 2016

2-Edge connected dominating sets and 2-Connected dominating sets of a graph.
J. Comb. Optim., 2016

2015
Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees.
Int. J. Comput. Math., 2015

Note on the spanning-tree packing number of lexicographic product graphs.
Discret. Math., 2015

A kind of conditional vertex connectivity of recursive circulants.
Ars Comb., 2015

2014
Note on Minimally d-Rainbow Connected Graphs.
Graphs Comb., 2014

Oriented diameter and rainbow connection number of a graph.
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
The generalized 3-connectivity of Cartesian product.
Discret. Math. Theor. Comput. Sci., 2012

Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees.
Discret. Math., 2012

Rainbow connection of graphs with diameter 2.
Discret. Math., 2012

2011
The (strong) rainbow connection numbers of Cayley graphs on Abelian groups.
Comput. Math. Appl., 2011

2010
Conditional connectivity of Cayley graphs generated by transposition trees.
Inf. Process. Lett., 2010

A kind of conditional fault tolerance of (n, k)-star graphs.
Inf. Process. Lett., 2010


  Loading...