An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/27893

Title:	An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs
Author:	Abiad, Aida; Fiol Mora, Miquel Àngel; Haemers, Willem H.; Perarnau Llobet, Guillem
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV; Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
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.
Abstract:	Peer Reviewed
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs -Graph theory -Laplacian matrix -eigenvalue interlacing -edge-connectivity -isoperimetric number -Grafs, Teoria de -05C Graph theory
Rights:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article - Published version Conference Object
Share: