论文信息 - The Laplacian spectral radii of trees with degree sequences

The Laplacian spectral radii of trees with degree sequences

In this paper, we characterize all extremal trees with the largest Laplacian spectral radius in the set of all trees with a given degree sequence. Consequently, we also obtain all extremal trees with the largest Laplacian spectral radius in the sets of all trees of order n with the largest degree, the leaves number and the matching number, respectively.

Xiao-Dong Zhang | Xiaodong Zhang

[1] Xiaodong Zhang,et al. The Laplacian spectrum of a mixed graph , 2002 .

[2] Jinlong Shu,et al. A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph , 2002 .

[3] Russell Merris,et al. The Laplacian Spectrum of a Graph II , 1994, SIAM J. Discret. Math..

[4] V. Sunder,et al. The Laplacian spectrum of a graph , 1990 .

[5] R. Merris. Laplacian matrices of graphs: a survey , 1994 .

[6] Improved bounds for the largest eigenvalue of trees , 2005 .

[7] T. D. Morley,et al. Eigenvalues of the Laplacian of a graph , 1985 .

[8] Zhang Xiaodong,et al. A new upper bound for eigenvalues of the laplacian matrix of a graph , 1997 .

[9] Xiaodong Zhang. On the two conjectures of Graffiti , 2004 .

[10] Dragan Stevanović. Bounding the largest eigenvalue of trees in terms of the largest vertex degree , 2003 .

[11] Ji-Ming Guo. On the Laplacian spectral radius of a tree , 2003 .