Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees

Discrete Mathematics

Volumn 296, Issue 2-3, 2005, Pages 187-197

  Hong, Yuan ^a   Zhang, Xiao Dong ^b  

^a EAST CHINA NORMAL UNIVERSITY   (China)

^b SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Laplacian eigenvalue; Pendant vertex; Tree

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; LAPLACE TRANSFORMS; MATRIX ALGEBRA; VECTORS;

BIPARTITE GRAPH; LAPLACIAN EIGENVALUES; LAPLACIAN MATRIX; PENDANT VERTEX;

TREES (MATHEMATICS);

EID: 22144445673     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.04.001     Document Type: Article

References (10)

1. A. Berman, and R.J. Plemmons Nonnegative Matrices in the Mathematical Sciences 1979 Academic New York SIAM, Philadelphia, PA, 1994
2. A. Berman, and X.D. Zhang On the spectral radius of graphs with cut vertices J. Combin. Theory B 83 2001 233 240
3. N. Biggs Algebraic Graph Theory second ed. 1995 Cambridge University Press Cambridge
4. D. Cao Bounds on eigenvalues and chromatic numbers Linear Algebra Appl. 270 1998 1 13
5. J.M. Guo On the Laplacian spectral radius of a tree Linear Algebra Appl. 368 2003 379 385
6. M. Hofmeister Spectral radius and degree sequence Math. Nachr. 139 1988 37 44
7. Q. Li, and K. Feng On the largest eigenvalue of a graph Acta Math. Appl. Sinica 2 1979 167 175 (in Chinese)
8. R. Merris Laplacian matrices of graphs: a survey Linear Algebra Appl. 197-198 1994 143 176
9. J. Shu, Y. Hong, and K. Wenren A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph Linear Algebra Appl. 347 2002 123 129
10. A.M. Yu, M. Lu, and F. Tian On the spectral radius of graphs Linear Algebra Appl. 387 2004 41 49