Zhibin Du

On the Estrada index of graphs with given number of cut edges

Let G be a simple graph with eigenvalues λ1, λ2, . . . , λn. The Estrada index of G is defined as EE(G) = ∑ n i=1 ei . In this paper, the unique graph with maximum Estrada index is determined among connected graphs with given numbers of vertices and cut edges.

On structural properties of trees with minimal atom-bond connectivity index III

The {\em atom-bond connectivity (ABC) index} is a degree-based graph topological index that found chemical applications. The problem of complete characterization of trees with minimal

On a family of trees with minimal atom-bond connectivity index

ABC

The Kirchhoff indices and the matching numbers of unicyclic graphs

index is still an open problem. In~\cite{d-sptmabci-2014}, it was shown that trees with minimal ABC index do not contain so-called {\em

Further results on the distance spectral radius of graphs

B_k

A proof of the conjecture regarding the sum of domination number and average eccentricity

-branches}, with

A note on chemical trees with minimum Wiener polarity index

k \geq 5

Some forbidden combinations of branches in minimal-ABC trees

, and that they do not have more than four

The singular acyclic matrices with the second largest number of P-vertices

B_4

Further results regarding the sum of domination number and average eccentricity

-branches. Our main results here reveal that the number of