Bounding the largest eigenvalue of trees in terms of the largest vertex degree
Author:
- Dragan StevanovićDSDragan Stevanović
- 1 February 2003
- journal article
- research article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 360, 35-42
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graphLinear Algebra and its Applications, 2002
- The Laplacian Spectrum of a Graph IISIAM Journal on Discrete Mathematics, 1994
- Laplacian matrices of graphs: a surveyLinear Algebra and its Applications, 1994
- The largest eigenvalue of a graph: A surveyLinear and Multilinear Algebra, 1990
- Eigenvalues of the Laplacian of a graph∗Linear and Multilinear Algebra, 1985
- On the eigenvalues of treesPeriodica Mathematica Hungarica, 1973
- Theory of monomer-dimer systemsCommunications in Mathematical Physics, 1972