On a lower bound for the Laplacian eigenvalues of a graph

DOI10.1007/S00373-017-1835-YMaRDI QIDQ1696537zbMATH OpenOpenAlexFDO

Authors Gary R. W. Greaves, Akihiro Munemasa, Anni Peng

Publication date 14 February 2018

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.03221

zbMATH Keywords

degree sequenceLaplacian eigenvalues

Mathematics Subject Classification ID

Vertex degrees (05C07) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: If $m{u}_m$ and $d_m$ denote, respectively, the $m$-th largest Laplacian eigenvalue and the $m$-th largest vertex degree of a graph, then $m{u}_{m}geqslant{d}_m-m+2$. This inequality was conjectured by Guo in 2007 and proved by Brouwer and Haemers in 2008. Brouwer and Haemers gave several examples of graphs achieving equality, but a complete characterisation was not given. In this paper we consider the problem of characterising graphs satisfying $m{u}_m=d_m-m+2$. In particular we give a full classification of graphs with $m{u}_m=d_m-m+2leqslant1$.

Recommendations

• A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo
• On Laplacian eigenvalues of connected graphs.
• Lower bounds of the Laplacian graph eigenvalues
• Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph
• A note on Laplacian graph eigenvalues

Cites work

• A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo
• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• On the third largest Laplacian eigenvalue of a graph
• Spectra of graphs
• The Laplacian Spectrum of a Graph II

Cited in

(8)

• Open problem on \(\sigma\)-invariant
• Bounds on the negative eigenvalues of Laplacians on finite metric graphs
• A lower bound on the least signless Laplacian eigenvalue of a graph
• Lower bounds of the Laplacian graph eigenvalues
• scientific article; zbMATH DE number 6007662 (Why is no real title available?)
• Classification of trees by Laplacian eigenvalue distribution and edge covering number
• Classification of graphs by Laplacian eigenvalue distribution and independence number
• A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo

This page was built for publication: On a lower bound for the Laplacian eigenvalues of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1696537)