Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
Authors:
- 1 July 2005
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 296 (2-3) , 187-197
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the spectral radius of graphsLinear Algebra and its Applications, 2004
- On the Laplacian spectral radius of a treeLinear Algebra and its Applications, 2003
- A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graphLinear Algebra and its Applications, 2002
- On the Spectral Radius of Graphs with Cut VerticesJournal of Combinatorial Theory, Series B, 2001
- Bounds on eigenvalues and chromatic numbersLinear Algebra and its Applications, 1998
- Laplacian matrices of graphs: a surveyLinear Algebra and its Applications, 1994
- Spectral Radius and Degree SequenceMathematische Nachrichten, 1988