2000 character limit reached
An Interlacing Approach for Bounding the Sum of Laplacian Eigenvalues of Graphs (1307.4670v2)
Published 17 Jul 2013 in math.SP and math.CO
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 and 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.
