An Interlacing Approach for Bounding the Sum of Laplacian Eigenvalues of Graphs

Aida Abiad Monge*, M.A. Fiol, W.H. Haemers, G. Perarnau

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of laplacian eigenvalues of graphs, and characterize equality. This leads to generalizations of, and variations on theorems by grone, and grone & merris. As a consequence we obtain inequalities involving bounds for some well-known parameters of a graph, such as edge-connectivity, and the isoperimetric number.
Original languageEnglish
Pages (from-to)11-21
JournalLinear Algebra and Its Applications
Volume34
DOIs
Publication statusPublished - 2014
Externally publishedYes

Fingerprint

Dive into the research topics of 'An Interlacing Approach for Bounding the Sum of Laplacian Eigenvalues of Graphs'. Together they form a unique fingerprint.

Cite this