Carregant...
Carregant...

Vés al contingut (premeu Retorn)

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

Autor
Abiad, A.; Fiol, M.; Haemers, Willem H.; Perarnau-Llobet, G.
Tipus d'activitat
Article en revista
Revista
Linear algebra and its applications
Data de publicació
2014-05-01
Volum
448
Pàgina inicial
11
Pàgina final
21
DOI
https://doi.org/10.1016/j.laa.2014.02.003 Obrir en finestra nova
Projecte finançador
Optimización y problemas extremales en teoria de grafos y combinatoria. Aplicacions a les redes de comunicación
URL
http://www.sciencedirect.com/science/article/pii/S0024379514000688 Obrir en finestra nova
Resum
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 Crone, 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. (C) 2014 Elsevier Inc. All rights reserved.
Paraules clau
Graph spectra, Laplacian matrix, Sum of eigenvalues
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants

  • Abiad, Aida  (autor)
  • Fiol Mora, Miquel Àngel  (autor)
  • Haemers, Willem H.  (autor)
  • Perarnau Llobet, Guillem  (autor)