Hengzhe Li

According to our database1, Hengzhe Li authored at least 23 papers between 2010 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
On the Steiner 4-Diameter of Graphs.
Journal of Interconnection Networks, 2018

Making a dominating set of a graph connected.
Discussiones Mathematicae Graph Theory, 2018

Steiner tree packing number and tree connectivity.
Discrete Mathematics, 2018

The λ3-connectivity and κ3-connectivity of recursive circulants.
Applied Mathematics and Computation, 2018

2017
Rainbow connection number of graphs with diameter 3.
Discussiones Mathematicae Graph Theory, 2017

Rainbow connection number and graph operations.
Discrete Applied Mathematics, 2017

The chromatic equivalence class of graph ψn3(n-3, 1).
Ars Comb., 2017

The generalized 3-connectivity of graph products.
Applied Mathematics and Computation, 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.
Discrete Mathematics, 2015

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

2014
Note on Minimally d-Rainbow Connected Graphs.
Graphs and Combinatorics, 2014

Oriented diameter and rainbow connection number of a graph.
Discrete Mathematics & Theoretical Computer Science, 2014

The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree.
Discrete Applied Mathematics, 2014

Note on the generalized connectivity.
Ars Comb., 2014

2012
The generalized 3-connectivity of Cartesian product.
Discrete Mathematics & Theoretical Computer Science, 2012

Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees.
Discrete Mathematics, 2012

Rainbow connection of graphs with diameter 2.
Discrete Mathematics, 2012

2011
The (strong) rainbow connection numbers of Cayley graphs on Abelian groups.
Computers & Mathematics with Applications, 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...