An Interlacing Approach for Bounding the Sum of Laplacian Eigenvalues of Graphs

Aida Abiad Monge, M.A. Fiol, W.H. Haemers, G. Perarnau

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)

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
Original languageEnglish
Pages (from-to)11-21
JournalLinear Algebra and Its Applications
Volume34
DOIs
Publication statusPublished - 2014

Cite this

@article{faac696d53764fb789d8183e39c92bf2,
title = "An Interlacing Approach for Bounding the Sum of Laplacian Eigenvalues of Graphs",
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.",
author = "{Abiad Monge}, Aida and M.A. Fiol and W.H. Haemers and G. Perarnau",
note = "NO DATA USED",
year = "2014",
doi = "10.1016/j.laa.2014.02.003",
language = "English",
volume = "34",
pages = "11--21",
journal = "Linear Algebra and Its Applications",
issn = "0024-3795",
publisher = "Elsevier Science",

}

An Interlacing Approach for Bounding the Sum of Laplacian Eigenvalues of Graphs. / Abiad Monge, Aida; Fiol, M.A.; Haemers, W.H.; Perarnau, G.

In: Linear Algebra and Its Applications, Vol. 34, 2014, p. 11-21.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - An Interlacing Approach for Bounding the Sum of Laplacian Eigenvalues of Graphs

AU - Abiad Monge, Aida

AU - Fiol, M.A.

AU - Haemers, W.H.

AU - Perarnau, G.

N1 - NO DATA USED

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

U2 - 10.1016/j.laa.2014.02.003

DO - 10.1016/j.laa.2014.02.003

M3 - Article

VL - 34

SP - 11

EP - 21

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

SN - 0024-3795

ER -