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 language | English |
---|---|
Pages (from-to) | 11-21 |
Number of pages | 11 |
Journal | Linear Algebra and its Applications |
Volume | 448 |
Early online date | 25 Feb 2014 |
DOIs | |
Publication status | Published - May 2014 |
Keywords
- Laplacian matrix
- Graph spectra
- Sum of eigenvalues