Abstract

We apply eigenvalue interlacing techniques for obtaining bounds for the sums of Laplacian eigenvalues of graphs. 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. Joint work with A. Abiad, M.A. Fiol and G. Perarnau.



Information: