Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4599614 | Linear Algebra and its Applications | 2014 | 11 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
A. Abiad, M.A. Fiol, W.H. Haemers, G. Perarnau,