AbstractDenote by T(n,q,w1,w2,…,wn-1) the set of n-vertex weighted trees with matching number q and fixed positive weight set Wn-1={w1,w2,…,wn-1}, where w1⩾w2⩾⋯⩾wn-1>0. Tan [S.W. Tan, On the sharp upper bound of spectral radius of weighted trees, J. Math. Res. Exposition 29 (2009) 293–301] determined the weighted tree in T(n,q,w1,w2,…,wn-1) with the largest adjacent spectral radius , whereas in [S.W. Tan, On the Laplacian spectral radius of weighted trees with a positive weight set, Discrete Math. 310 (2010) 1026–1036] Tan determined the weighted tree in T(n,q,w1,w2,…,wn-1) with the largest Laplacian spectral radius. In this paper, we use a unified approach to identify the unique weighted tree in T(n,q,w1,w2,…,wn-1) with the largest adjacen...
AbstractWe consider weighted graphs, where the edge weights are positive definite matrices. In this ...
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...
AbstractDenote by T(n,q,w1,w2,…,wn-1) the set of n-vertex weighted trees with matching number q and ...
AbstractThe spectrum of weighted graphs is often used to solve the problems in the design of network...
AbstractWe determine the (unique) weighted tree with the largest spectral radius with respect to the...
AbstractThe spectrum of weighted graphs is often used to solve the problems in the design of network...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
AbstractThe spectrum of weighted graphs are often used to solve the problems in the design of networ...
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...
AbstractDenote by Tn the set of trees on n vertices. Zhang, Li [X.D. Zang, J.S. Li, The two largest ...
AbstractWe determine the (unique) weighted tree with the largest spectral radius with respect to the...
AbstractIn this paper we consider the following problem: Of all trees of order n with k pendant vert...
AbstractThe spectrum of weighted graphs are often used to solve the problems in the design of networ...
AbstractWe consider weighted graphs, where the edge weights are positive definite matrices. In this ...
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...
AbstractDenote by T(n,q,w1,w2,…,wn-1) the set of n-vertex weighted trees with matching number q and ...
AbstractThe spectrum of weighted graphs is often used to solve the problems in the design of network...
AbstractWe determine the (unique) weighted tree with the largest spectral radius with respect to the...
AbstractThe spectrum of weighted graphs is often used to solve the problems in the design of network...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
AbstractThe spectrum of weighted graphs are often used to solve the problems in the design of networ...
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...
AbstractDenote by Tn the set of trees on n vertices. Zhang, Li [X.D. Zang, J.S. Li, The two largest ...
AbstractWe determine the (unique) weighted tree with the largest spectral radius with respect to the...
AbstractIn this paper we consider the following problem: Of all trees of order n with k pendant vert...
AbstractThe spectrum of weighted graphs are often used to solve the problems in the design of networ...
AbstractWe consider weighted graphs, where the edge weights are positive definite matrices. In this ...
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...