1 citations · 1 across the 6 of their papers we have counts for
6 papers
On the -spectral radius of graphs without linear forests
Ming-Zhu Chen, A-Ming Liu, Xiao-Dong Zhang
Let and be the adjacency and degree matrices of a simple graph on vertices, respectively. The \emph{-spectral radius} of is the largest eigenvalue of…
Turán numbers for disjoint paths
Long-Tu Yuan, Xiao-Dong Zhang
The Turán number of a graph , , is the maximum number of edges in any graph of order which does not contain as a subgraph. Lidický, Liu and Palmer determined $e…
Maximum atom-bond connectivity index with given graph parameters
Xiu-Mei Zhang, Yu Yang, Hua Wang +1
The atom-bond connectivity (ABC) index is a degree-based topological index. It was introduced due to its applications in modeling the properties of certain molecular structures and…
A Sharp upper bound for the spectral radius of a nonnegative matrix and applications
Lihua You, Yujie Shu, Xiao-Dong Zhang
In this paper, we obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Lap…
The Laplacian Eigenvalues and Invariants of Graphs
Rong-Ying Pan, Jing Yan, Xiao-Dong Zhang
In this paper, we investigate some relations between the invariants (including vertex and edge connectivity and forwarding indices) of a graph and its Laplacian eigenvalues. In add…
On the Erdos-Sos Conjecture for Graphs on n=k+4 Vertices
Long-Tu Yuan, Xiao-Dong Zhang
The Erdős-Sós Conjecture states that if is a simple graph of order with average degree more than then contains every tree of order . In this paper, we prove t…