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

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

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

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.contributor	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.author	Abiad, Aida
dc.contributor.author	Fiol Mora, Miquel Àngel
dc.contributor.author	Haemers, Willem H.
dc.contributor.author	Perarnau Llobet, Guillem
dc.date	2014
dc.identifier.citation	Abiad, A. [et al.]. An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs. A: Jornadas de Matemática Discreta y Algorítmica. "IX Jornadas de Matemática Discreta y Algorítmica : Tarragona, 7-9 de Julio de 2014". Tarragona: 2014, p. 9-19.
dc.identifier.uri	http://hdl.handle.net/2117/27893
dc.language.iso	eng
dc.relation	http://deim.urv.cat/~discrete-math/JMDA2014/Actas.pdf
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
dc.subject	Graph theory
dc.subject	Laplacian matrix
dc.subject	eigenvalue interlacing
dc.subject	edge-connectivity
dc.subject	isoperimetric number
dc.subject	Grafs, Teoria de
dc.subject	05C Graph theory
dc.title	An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/conferenceObject
dc.description.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.
dc.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author