Sharp upper bounds for the Laplacian graph eigenvalues

Linear Algebra and Its Applications

Volumn 355, Issue 1-3, 2002, Pages 287-295

  Pan, Yong Liang ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Graph; Laplacian matrix; Largest eigenvalue; Upper bound

Indexed keywords

GRAPH THEORY; LAPLACE TRANSFORMS; SET THEORY; THEOREM PROVING;

GRAPHS; LAPLACIAN MATRIX; LARGEST EIGENVALUE; UPPER BOUND;

EIGENVALUES AND EIGENFUNCTIONS;

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

References (6)

1. Anderson W.N., Morley T.D. Eigenvalues of the Laplacian of a graph. Linear and Multilinear Algebra. 18:1985;141-145.
2. Brualdi R.A., Ryser H.J. Combinatorial Matrix Theory. 1991;Cambridge University Press, New York.
3. Horn R.A., Johnson C.R. Matrix Analysis. 1985;Cambridge University Press, New York.
4. Li J.S., Zhang X.D. A new upper bound for eigenvalues of the Laplacian matrix of graphs. Linear Algebra Appl. 265:1997;93-100.
5. Li J.S., Zhang X.D. On the Laplacian eigenvalues of a graph. Linear Algebra Appl. 285:1998;305-307.
6. Merris R. A note on Laplacian graph eigenvalues. Linear Algebra Appl. 285:1998;33-35.