Brouwer, A.E. Haemers, W.H. (Tilburg University, Center for Economic Research)
Abstract
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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
2008-27.