Hongbo Hua

VLDB 2026 Research / reviewers in the wild / expert

dblp:22/1809 · DBLP profile ↗

← Back

21ranked-venue papers

15as first author

9since 2021 · last 2026

0000-0001-7152-466XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 21 · 15 first-author · 9 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author

Year	Publication	Venue	Position
2026	Signless Laplacian spectral conditions for even factors in graphs Hechao Liu, Hongbo Hua, Zenan Du	Discret. Appl. Math.	3
2026	Enumeration of spanning trees and resistance distances of generalized blow-up graphs Hechao Liu, Lihua You, Hongbo Hua	Discret. Appl. Math.	4
2025	Further results on the mixed metric dimension of graphs abstract Let G be a graph with vertex set V ( G ) and edge set E ( G ) . The mixed metric dimension of a connected graph G , denoted by dim m ( G ) , is the minimum cardinality of a subset S ⊆ V ( G ) such that for any two u , v ∈ V ( G ) ∪ E ( G ) , there exists w ∈ S so that the distance between w and u is not equal to the distance between w and v . In this paper, we present further results on the mixed metric dimension. First, we give a sharp upper bound on the mixed metric dimension for a graph in terms of the number of cut vertices of this graph. Second, we compare the mixed metric dimension with geodesic transversal number for trees , unicyclic graphs and block graphs. Finally, we provide some new results about a conjecture, due to Sedlar and Škrekovski (Sedlar and Škrekovski, 2021), on the mixed metric dimension. Hongbo Hua, Yaojun Chen, Xinying Hua	Discret. Appl. Math.	1
2024	Some results on vulnerability parameters and Wiener-type indices Hongbo Hua, Hechao Liu	Discret. Appl. Math.	1
2024	Some sufficient conditions for graphs to be k-leaf-connected Hechao Liu, Lihua You, Hongbo Hua, Zenan Du	Discret. Appl. Math.	3
2023	Relations between degree-based graph invariants Hongbo Hua	Discret. Appl. Math.	1
2023	Relating the annihilation number and the total domination number for some graphs Xinying Hua, Kexiang Xu, Hongbo Hua	Discret. Appl. Math.	3
2022	On the resistance diameters of graphs and their line graphs Si-Ao Xu, Yun-Xiang Li, Hongbo Hua, Xiang-Feng Pan	Discret. Appl. Math.	3
2021	The hexagonal chains with the first three maximal Mostar indices Qiqi Xiao, Mingyao Zeng, Zikai Tang, Hongbo Hua, Hanyuan Deng	Discret. Appl. Math.	4
2020	On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2 Hongbo Hua	Discret. Appl. Math.	1
2020	Comparative results and bounds for the eccentric-adjacency index Hongbo Hua, Kinkar Chandra Das	Discret. Appl. Math.	1
2020	Further results on the Merrifield-Simmons index Hongbo Hua, Xinying Hua, Hongzhuan Wang	Discret. Appl. Math.	1
2019	On the peripheral Wiener index of graphs Hongbo Hua	Discret. Appl. Math.	1
2018	On eccentric distance sum and degree distance of graphs Hongbo Hua, Hongzhuan Wang	Discret. Appl. Math.	1
2015	The difference between remoteness and radius of a graph Hongbo Hua, Yaojun Chen, Kinkar Chandra Das	Discret. Appl. Math.	1
2014	Proof of conjectures on remoteness and proximity in graphs Hongbo Hua, Kinkar Chandra Das	Discret. Appl. Math.	1
2013	The relationship between the eccentric connectivity index and Zagreb indices Hongbo Hua, Kinkar Chandra Das	Discret. Appl. Math.	1
2012	On the reciprocal degree distance of graphs Hongbo Hua, Shenggui Zhang	Discret. Appl. Math.	1
2012	Further results on the eccentric distance sum Hongbo Hua, Shenggui Zhang, Kexiang Xu	Discret. Appl. Math.	1
2011	Graphs with given number of cut vertices and extremal Merrifield-Simmons index Hongbo Hua, Shenggui Zhang	Discret. Appl. Math.	1
2009	On graphs with the third largest number of maximal independent sets Hongbo Hua, Yaoping Hou	Inf. Process. Lett.	1