@techreport{a10326d78c4742d084f7fa427c2148d2,

title = "A Lower Bound for the Laplacian Eigenvalues of a Graph-Proof of a Conjecture by Guo",

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.",

keywords = "Graphs, Laplacian eigenvalues. JEL-code",

author = "A.E. Brouwer and W.H. Haemers",

note = "Subsequently published in Linear Algebra and its Applications, 2008 Pagination: 6",

year = "2008",

language = "English",

volume = "2008-27",

series = "CentER Discussion Paper",

publisher = "Operations research",

type = "WorkingPaper",

institution = "Operations research",

}