A lower bound for the Laplacian eigenvalues of a graph : Proof of a conjecture by Guo

A.E. Brouwer, W.H. Haemers

Research output: Contribution to journalArticleAcademicpeer-review

26 Citations (Scopus)

Abstract

We show that if µj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree (1 = j = n) of a connected graph G on n vertices, then µj = dj - j + 2 (1 = j = n - 1). This settles a conjecture due to Guo. © 2008 Elsevier Inc. All rights reserved.
Original languageEnglish
Pages (from-to)2131-2135
JournalLinear Algebra and Its Applications
Volume429
Issue number8-9
DOIs
Publication statusPublished - 2008

Fingerprint Dive into the research topics of 'A lower bound for the Laplacian eigenvalues of a graph : Proof of a conjecture by Guo'. Together they form a unique fingerprint.

Cite this