default search action
Hengzhe Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j35]Lijun Xiong, Haiping Yuan
, Hengzhe Li
Synergy Prediction Model of Information Entropy Based on Zone Safety Degree and Stope Roof Weighting Step Analysis. Axioms 12(9): 892 (2024) - [j34]Shu-Li Zhao, Hengzhe Li, Jou-Ming Chang
On the minimum size of graphs with given generalized connectivity. Discret. Appl. Math. 355: 88-95 (2024) - [j33]Hengzhe Li, Menghan Ma, Jianbing Liu
Addible edges in 2-matching-connected graphs and 3-matching-connected graphs. Discret. Appl. Math. 357: 274-281 (2024) - [j32]Xiao Zhao, Haojie Zheng, Hengzhe Li:
The K1,2-structure-connectivity of graphs. J. Supercomput. 80(17): 25470-25483 (2024) - 2023
- [j31]Shu-Li Zhao, Jou-Ming Chang, Hengzhe Li:
The generalized 4-connectivity of pancake graphs. Discret. Appl. Math. 327: 77-86 (2023) - [j30]Lijun Xiong, Haiping Yuan
Synergetic Theory of Information Entropy Based on Failure Approach Index for Stability Analysis of Surrounding Rock System. Entropy 25(8): 1237 (2023) - [j29]Hengzhe Li, Huayue Liu, Jianbing Liu
Edge-Disjoint Steiner Trees and Connectors in Graphs. Graphs Comb. 39(2): 23 (2023) - [j28]Hengzhe Li
2-(Ddge-)Connected Edge Domination Number and Matching Number. Graphs Comb. 39(2): 31 (2023) - [j27]Hengzhe Li
The λ4-Connectivity of the Cartesian Product of Trees. J. Interconnect. Networks 23(3): 2250007:1-2250007:22 (2023) - 2022
- [j26]Hengzhe Li, Yingbin Ma, Yan Zhao:
Total Rainbow Connection Number of Some Graph Operations. Axioms 11(6): 254 (2022) - 2021
- [j25]Xueliang Li, Hengzhe Li, Yingbin Ma:
The vertex- rainbow connection number of some graph operations. Discuss. Math. Graph Theory 41(2): 513-530 (2021) - 2020
- [j24]Hengzhe Li, Yuanyuan Lu
The κk-connectivity of line graphs. Discret. Appl. Math. 285: 1-8 (2020)
2010 – 2019
- 2018
- [j23]Hengzhe Li
The λ3-connectivity and κ3-connectivity of recursive circulants. Appl. Math. Comput. 339: 750-757 (2018) - [j22]Hengzhe Li, Baoyindureng Wu
Steiner tree packing number and tree connectivity. Discret. Math. 341(7): 1945-1951 (2018) - [j21]Hengzhe Li, Baoyindureng Wu, Weihua Yang:
Making a dominating set of a graph connected. Discuss. Math. Graph Theory 38(4): 947-962 (2018) - [j20]Zhao Wang, Yaping Mao, Hengzhe Li, Chengfu Ye:
On the Steiner 4-Diameter of Graphs. J. Interconnect. Networks 18(1): 1850002:1-1850002:15 (2018) - 2017
- [j19]Hengzhe Li
The generalized 3-connectivity of graph products. Appl. Math. Comput. 295: 77-83 (2017) - [j18]Yaping Mao, Chengfu Ye, Hengzhe Li, Shumin Zhang:
The chromatic equivalence class of graph ψn3(n-3, 1). Ars Comb. 135: 399-421 (2017) - [j17]Hengzhe Li
Rainbow connection number and graph operations. Discret. Appl. Math. 230: 91-99 (2017) - [j16]Xueliang Li, Hengzhe Li
Rainbow connection number of graphs with diameter 3. Discuss. Math. Graph Theory 37(1): 141-154 (2017) - 2016
- [j15]Hengzhe Li
2-Edge connected dominating sets and 2-Connected dominating sets of a graph. J. Comb. Optim. 31(2): 713-724 (2016) - [j14]Xingchao Deng, Hengzhe Li
Algorithm on rainbow connection for maximal outerplanar graphs. Theor. Comput. Sci. 651: 76-86 (2016) - 2015
- [j13]Hengzhe Li, Weihua Yang, Jixiang Meng:
A kind of conditional vertex connectivity of recursive circulants. Ars Comb. 122: 3-12 (2015) - [j12]Hengzhe Li
Note on the spanning-tree packing number of lexicographic product graphs. Discret. Math. 338(5): 669-673 (2015) - [j11]Weihua Yang, Hengzhe Li
Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees. Int. J. Comput. Math. 92(7): 1345-1352 (2015) - 2014
- [j10]Hengzhe Li, Xueliang Li, Yaping Mao, Yuefang Sun:
Note on the generalized connectivity. Ars Comb. 114: 193-202 (2014) - [j9]Weihua Yang, Yingzhi Tian, Hengzhe Li
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree. Discret. Appl. Math. 167: 304-309 (2014) - [j8]Xiaolong Huang, Hengzhe Li, Xueliang Li, Yuefang Sun
Oriented diameter and rainbow connection number of a graph. Discret. Math. Theor. Comput. Sci. 16(3): 51-60 (2014) - [j7]Hengzhe Li
Note on Minimally d-Rainbow Connected Graphs. Graphs Comb. 30(4): 949-955 (2014) - 2012
- [j6]Hengzhe Li
Rainbow connection of graphs with diameter 2. Discret. Math. 312(8): 1453-1457 (2012) - [j5]Hengzhe Li
Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees. Discret. Math. 312(21): 3087-3095 (2012) - [j4]Hengzhe Li, Xueliang Li, Yuefang Sun:
The generalized 3-connectivity of Cartesian product. Discret. Math. Theor. Comput. Sci. 14(1): 43-54 (2012) - 2011
- [j3]Hengzhe Li
The (strong) rainbow connection numbers of Cayley graphs on Abelian groups. Comput. Math. Appl. 62(11): 4082-4088 (2011) - 2010
- [j2]Weihua Yang, Hengzhe Li
A kind of conditional fault tolerance of (n, k)-star graphs. Inf. Process. Lett. 110(22): 1007-1011 (2010) - [j1]Weihua Yang, Hengzhe Li
Conditional connectivity of Cayley graphs generated by transposition trees. Inf. Process. Lett. 110(23): 1027-1030 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 00:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: