DOIAbstract
AbstractLet T(n,d) be the set of trees on n vertices with diameter d. In this paper, the first d2+1 Laplacian spectral radii of trees in the set T(n,d) (3⩽d⩽n−3) are characterized
AbstractLet T(n,d) be the set of trees on n vertices with diameter d. In this paper, the first d2+1 Laplacian spectral radii of trees in the set T(n,d) (3⩽d⩽n−3) are characterized
AbstractLet G=(V,E) be a graph on vertex set V={v1,v2,…,vn}. For any vertex vi, we denote by N(vi) t...
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distan...
The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let $...
AbstractLet T(n, d) be the set of trees on n vertices with diameter d. In this paper, the first d2+1...
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 ...
AbstractLet T(n,Δ) be the set of all trees on n vertices with a given maximum degree Δ. In this pape...
AbstractIn this paper, we characterize all extremal trees with the largest Laplacian spectral radius...
AbstractDenote by T(n,q,w1,w2,…,wn-1) the set of n-vertex weighted trees with matching number q and ...
AbstractLet Δ(T) and μ(T) denote the maximum degree and the Laplacian spectral radius of a tree T, r...
AbstractIn this paper, we investigated the spectral radius of trees and obtained the following resul...
AbstractFor a graph G, its Laplacian matrix is the difference of the diagonal matrix of its vertex d...
AbstractLet B(n,d) be the set of bipartite graphs with order n and diameter d. The extremal graph Gd...
Abstract Let T be a tree with at least four vertices, none of which has degree 2, embedded in the pl...
Submitted by S. Kirkland Denote by Tn the set of trees on n vertices. Zhang and Li [X.D. Zang, J.S. ...
AbstractLet G=(V,E) be a graph on vertex set V={v1,v2,…,vn}. For any vertex vi, we denote by N(vi) t...
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distan...
The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let $...
AbstractLet T(n, d) be the set of trees on n vertices with diameter d. In this paper, the first d2+1...
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 ...
AbstractLet T(n,Δ) be the set of all trees on n vertices with a given maximum degree Δ. In this pape...
AbstractIn this paper, we characterize all extremal trees with the largest Laplacian spectral radius...
AbstractDenote by T(n,q,w1,w2,…,wn-1) the set of n-vertex weighted trees with matching number q and ...
AbstractLet Δ(T) and μ(T) denote the maximum degree and the Laplacian spectral radius of a tree T, r...
AbstractIn this paper, we investigated the spectral radius of trees and obtained the following resul...
AbstractFor a graph G, its Laplacian matrix is the difference of the diagonal matrix of its vertex d...
AbstractLet B(n,d) be the set of bipartite graphs with order n and diameter d. The extremal graph Gd...
Abstract Let T be a tree with at least four vertices, none of which has degree 2, embedded in the pl...
Submitted by S. Kirkland Denote by Tn the set of trees on n vertices. Zhang and Li [X.D. Zang, J.S. ...
AbstractLet G=(V,E) be a graph on vertex set V={v1,v2,…,vn}. For any vertex vi, we denote by N(vi) t...
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distan...
The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let $...
Add to ORKG