Bounding the largest eigenvalue of trees in terms of the largest vertex degree

Linear Algebra and Its Applications

Volumn 360, Issue , 2003, Pages 35-42

  Stevanović, Dragan ^a,b  

^a BIELEFELD UNIVERSITY   (Germany)

^b UNIVERSITY OF NI   (Serbia)

Author keywords

Adjacency matrix; Laplacian matrix; Largest eigenvalue; Tree

Indexed keywords

EID: 84867968386     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(02)00442-1     Document Type: Article

References (11)

1. W.N. Anderson, and T.D. Morley Eigenvalues of the Laplacian of a graph Linear and Multilinear Algebra 18 1985 141 145
2. N. Biggs Algebraic Graph Theory 1974 Cambridge University Press Cambridge
3. D. Cvetković, M. Doob, and H. Sachs Spectra of graphs-theory and application 1995 Johann Ambrosius Barth Verlag Heidelberg-Leipzig
4. D. Cvetković, and P. Rowlinson The largest eigenvalue of a graph: a survey Linear and Multilinear Algebra 28 1990 3 33
5. C.D. Godsil Spectra of trees Annals of Discrete Mathematics 20 1984 151 159
6. C.D. Godsil, and I. Gutman Wiener index, graph spectrum, line graph ACH Models Chem. 136 1999 503 510
7. R. Grone, and R. Merris The Laplacian spectrum of a graph (II) SIAM J. Discrete Math. 7 1994 221 229
8. O.J. Heilmann, and E.H. Lieb Theory of monomer-dimer systems Commun. Math. Phys. 25 1972 190 232
9. L. Lovász, and J. Pelikan On the eigenvalues of trees Periodica Math. Hung. 3 1973 175 182
10. R. Merris Laplacian matrices of graphs: a survey Linear Algebra Appl. 197, 198 1994 143 176
11. J.L. Shu, Y. Hong, and K. Wen-Ren A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph Linear Algebra Appl. 347 2002 123 129