default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHongbo Hua
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Hechao Liu, Lihua You
, Hongbo Hua, Zenan Du:
Some sufficient conditions for graphs to be k-leaf-connected. Discret. Appl. Math. 352: 1-8 (2024)- [j29]Hongbo Hua, Hechao Liu:
Some results on vulnerability parameters and Wiener-type indices. Discret. Appl. Math. 358: 262-271 (2024) - 2023
- [j28]Hongbo Hua, Xiaolan Hu:
Relations between degree-based graph invariants. Discret. Appl. Math. 327: 60-67 (2023) - [j27]Xinying Hua, Kexiang Xu, Hongbo Hua:
Relating the annihilation number and the total domination number for some graphs. Discret. Appl. Math. 332: 41-46 (2023) - 2022
- [j26]Si-Ao Xu, Yun-Xiang Li, Hongbo Hua, Xiang-Feng Pan:
On the resistance diameters of graphs and their line graphs. Discret. Appl. Math. 306: 174-185 (2022) - [j25]Hongbo Hua, Xinying Hua, Sandi Klavzar, Kexiang Xu:
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs. Discret. Math. 345(9): 112965 (2022) - [j24]Yun-Xiang Li, Si-Ao Xu, Hongbo Hua, Xiang-Feng Pan:
On the resistance diameter of the Cartesian and lexicographic product of paths. J. Appl. Math. Comput. 68(3): 1743-1755 (2022) - 2021
- [j23]Qiqi Xiao, Mingyao Zeng, Zikai Tang, Hongbo Hua, Hanyuan Deng:
The hexagonal chains with the first three maximal Mostar indices. Discret. Appl. Math. 288: 180-191 (2021) - [j22]Hongbo Hua:
Toughness and isolated toughness conditions for $$P_{\ge 3}$$-factor uniform graphs. J. Appl. Math. Comput. 66(1-2): 809-821 (2021) - 2020
- [j21]Hongbo Hua, Xinying Hua, Hongzhuan Wang:
Further results on the Merrifield-Simmons index. Discret. Appl. Math. 283: 231-241 (2020) - [j20]Hongbo Hua, Kinkar Chandra Das:
Comparative results and bounds for the eccentric-adjacency index. Discret. Appl. Math. 285: 188-196 (2020) - [j19]Hongbo Hua:
On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2. Discret. Appl. Math. 285: 297-300 (2020) - [j18]Ivan Gutman, Hongbo Hua, Hongzhuan Wang:
Comparing eccentricity-based graph invariants. Discuss. Math. Graph Theory 40(4): 1111-1125 (2020) - [j17]Hongzhuan Wang, Hongbo Hua, Maolin Wang:
Comparative study of distance-based graph invariants. J. Appl. Math. Comput. 64(1-2): 457-469 (2020)
2010 – 2019
- 2019
- [j16]Hongbo Hua:
On the peripheral Wiener index of graphs. Discret. Appl. Math. 258: 135-142 (2019) - 2018
- [j15]Hongbo Hua, Hongzhuan Wang, Xiaolan Hu:
On eccentric distance sum and degree distance of graphs. Discret. Appl. Math. 250: 262-275 (2018) - 2016
- [j14]Hongbo Hua, Kinkar Chandra Das:
On the Wiener polarity index of graphs. Appl. Math. Comput. 280: 162-167 (2016) - 2015
- [j13]Hongbo Hua, Libing Zhang:
The total number of matchings in triangle graph of a connected graph. Ars Comb. 118: 243-251 (2015) - [j12]Hongbo Hua, Yaojun Chen, Kinkar Chandra Das:
The difference between remoteness and radius of a graph. Discret. Appl. Math. 187: 103-110 (2015) - 2014
- [j11]Hongbo Hua, Kinkar Chandra Das:
Proof of conjectures on remoteness and proximity in graphs. Discret. Appl. Math. 171: 72-80 (2014) - 2013
- [j10]Hongbo Hua, Kinkar Chandra Das:
The relationship between the eccentric connectivity index and Zagreb indices. Discret. Appl. Math. 161(16-17): 2480-2491 (2013) - 2012
- [j9]Dongdong Wang, Hongbo Hua:
On minimal energy of bipartite unicyclic graphs of a given bipartition. Ars Comb. 107: 169-176 (2012) - [j8]Hongbo Hua, Shenggui Zhang, Kexiang Xu:
Further results on the eccentric distance sum. Discret. Appl. Math. 160(1-2): 170-180 (2012) - [j7]Hongbo Hua, Shenggui Zhang:
On the reciprocal degree distance of graphs. Discret. Appl. Math. 160(7-8): 1152-1163 (2012) - 2011
- [j6]Hongbo Hua:
On Maximum Merrifield-Simmons Index of Unicyclic Graphs with Prescribed Pendent Vertices. Ars Comb. 100: 365-379 (2011) - [j5]Hongbo Hua, Shenggui Zhang:
Graphs with given number of cut vertices and extremal Merrifield-Simmons index. Discret. Appl. Math. 159(10): 971-980 (2011)
2000 – 2009
- 2009
- [j4]Hongbo Hua:
A sharp upper bound for the number of stable sets in graphs with given number of cut edges. Appl. Math. Lett. 22(9): 1380-1385 (2009) - [j3]Hongbo Hua, Yaoping Hou:
On graphs with the third largest number of maximal independent sets. Inf. Process. Lett. 109(4): 248-253 (2009) - 2008
- [j2]Dongdong Wang, Hongbo Hua:
Minimality considerations for graph energy over a class of graphs. Comput. Math. Appl. 56(12): 3181-3187 (2008) - [j1]Hongbo Hua:
Minimizing a class of unicyclic graphs by means of Hosoya index. Math. Comput. Model. 48(5-6): 940-948 (2008)
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-10 01:12 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:
