Hongbo Hua

Yaojun Chen

Xinying Hua

Discret. Appl. Math., 2025

2024

Some sufficient conditions for graphs to be k-leaf-connected.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Some results on vulnerability parameters and Wiener-type indices.

[BibT_eX]

[DOI]

Hechao Liu

Discret. Appl. Math., 2024

2023

Relating the annihilation number and the total domination number for some graphs.

[BibT_eX]

[DOI]

Xinying Hua

Kexiang Xu

Discret. Appl. Math., June, 2023

Relations between degree-based graph invariants.

[BibT_eX]

[DOI]

Xiaolan Hu

Discret. Appl. Math., 2023

2022

On the resistance diameter of the Cartesian and lexicographic product of paths.

[BibT_eX]

[DOI]

J. Appl. Math. Comput., June, 2022

Relating the total domination number and the annihilation number for quasi-trees and some composite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

On the resistance diameters of graphs and their line graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Toughness and isolated toughness conditions for $$P_{\ge 3}$$-factor uniform graphs.

[BibT_eX]

[DOI]

J. Appl. Math. Comput., June, 2021

The hexagonal chains with the first three maximal Mostar indices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

Comparative study of distance-based graph invariants.

[BibT_eX]

[DOI]

Maolin Wang

J. Appl. Math. Comput., October, 2020

Comparing eccentricity-based graph invariants.

[BibT_eX]

[DOI]

Ivan Gutman

Discuss. Math. Graph Theory, 2020

Further results on the Merrifield-Simmons index.

[BibT_eX]

[DOI]

Xinying Hua

Discret. Appl. Math., 2020

Comparative results and bounds for the eccentric-adjacency index.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

On the peripheral Wiener index of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

On eccentric distance sum and degree distance of graphs.

[BibT_eX]

[DOI]

Xiaolan Hu

Discret. Appl. Math., 2018

2016

On the Wiener polarity index of graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2016

2015

The difference between remoteness and radius of a graph.

[BibT_eX]

[DOI]

Yaojun Chen

Discret. Appl. Math., 2015

The total number of matchings in triangle graph of a connected graph.

[BibT_eX]

Libing Zhang

Ars Comb., 2015

2014

Proof of conjectures on remoteness and proximity in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

The relationship between the eccentric connectivity index and Zagreb indices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

Further results on the eccentric distance sum.

[BibT_eX]

[DOI]

Shenggui Zhang

Kexiang Xu

Discret. Appl. Math., 2012

On the reciprocal degree distance of graphs.

[BibT_eX]

[DOI]

Shenggui Zhang

Discret. Appl. Math., 2012

On minimal energy of bipartite unicyclic graphs of a given bipartition.

[BibT_eX]

Dongdong Wang

Ars Comb., 2012

2011

Graphs with given number of cut vertices and extremal Merrifield-Simmons index.

[BibT_eX]

[DOI]

Shenggui Zhang

Discret. Appl. Math., 2011

On Maximum Merrifield-Simmons Index of Unicyclic Graphs with Prescribed Pendent Vertices.

[BibT_eX]

Ars Comb., 2011

2009

On graphs with the third largest number of maximal independent sets.

[BibT_eX]

[DOI]

Yaoping Hou

Inf. Process. Lett., 2009

A sharp upper bound for the number of stable sets in graphs with given number of cut edges.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2009

2008

Minimizing a class of unicyclic graphs by means of Hosoya index.

[BibT_eX]

[DOI]

Math. Comput. Model., 2008

Minimality considerations for graph energy over a class of graphs.

[BibT_eX]

[DOI]

Dongdong Wang