A Lower Bound for the Laplacian Eigenvalues of a Graph-Proof of a Conjecture by Guo

We show that if μj is the j-th largest Laplacian eigenvalue, and dj is the j-th largest degree (1 j n) of a connected graph 蚠 on n vertices, then μj dj − j + 2 (1 j n − 1). This settles a conjecture due to Guo.

MoreLess

Year of publication:	2008
Authors:	Brouwer, A.E. ; Haemers, W.H.
Institutions:	Tilburg University, Center for Economic Research
Subject:	Graphs \| Laplacian eigenvalues.

More details

Extent:	application/pdf
Series:	Discussion Paper.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series CentER Discussion Paper Number 2008-27
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011090653