AbstractDenote by Tn the set of trees on n vertices. Zhang, Li [X.D. Zang, J.S. Li, The two largest eigenvalues of Laplacian matrices of trees (in Chinese), J. China Univ. Sci. Technol. 28 (1998) 513–518] and Guo [J.M. Guo, On the Laplacian spectral radius of a tree, Linear Algebra Appl. 368 (2003) 379–385] give the first four trees in Tn, ordered according to their Laplacian spectral radii. In this paper, we determine the fifth to eighth trees in the above ordering
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
AbstractLet B(n,d) be the set of bipartite graphs with order n and diameter d. The extremal graph Gd...
Submitted by S. Kirkland Denote by Tn the set of trees on n vertices. Zhang and Li [X.D. Zang, J.S. ...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
AbstractLet T(n,d) be the set of trees on n vertices with diameter d. In this paper, the first d2+1 ...
AbstractDenote by Tn,q the set of trees with n vertices and matching number q. Guo [On the Laplacian...
AbstractFor a graph G, its Laplacian matrix is the difference of the diagonal matrix of its vertex d...
AbstractIn this paper, we characterize all extremal trees with the largest Laplacian spectral radius...
AbstractA unicyclic graph is a graph whose number of edges is equal to the number of vertices. Guo S...
AbstractDenote by Tn,q the set of trees with n vertices and matching number q. Guo [On the Laplacian...
AbstractIn this paper, we study the Laplacian spectral radius of trees on n vertices with domination...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractA connected graph of order n is bicyclic if it has n+1 edges. He et al. [C.X. He, J.Y. Shao,...
AbstractDenote by T(n,q,w1,w2,…,wn-1) the set of n-vertex weighted trees with matching number q and ...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
AbstractLet B(n,d) be the set of bipartite graphs with order n and diameter d. The extremal graph Gd...
Submitted by S. Kirkland Denote by Tn the set of trees on n vertices. Zhang and Li [X.D. Zang, J.S. ...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
AbstractLet T(n,d) be the set of trees on n vertices with diameter d. In this paper, the first d2+1 ...
AbstractDenote by Tn,q the set of trees with n vertices and matching number q. Guo [On the Laplacian...
AbstractFor a graph G, its Laplacian matrix is the difference of the diagonal matrix of its vertex d...
AbstractIn this paper, we characterize all extremal trees with the largest Laplacian spectral radius...
AbstractA unicyclic graph is a graph whose number of edges is equal to the number of vertices. Guo S...
AbstractDenote by Tn,q the set of trees with n vertices and matching number q. Guo [On the Laplacian...
AbstractIn this paper, we study the Laplacian spectral radius of trees on n vertices with domination...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractA connected graph of order n is bicyclic if it has n+1 edges. He et al. [C.X. He, J.Y. Shao,...
AbstractDenote by T(n,q,w1,w2,…,wn-1) the set of n-vertex weighted trees with matching number q and ...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
AbstractLet B(n,d) be the set of bipartite graphs with order n and diameter d. The extremal graph Gd...