Skip to main content

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

  • Conference paper
The Seventh European Conference on Combinatorics, Graph Theory and Applications

Part of the book series: CRM Series ((CRMSNS,volume 16))

  • 899 Accesses

Abstract

We apply interlacing techniques for obtaining lower and upper bounds for the sums of Laplacian eigenvalues of graphs. Mainly, we generalize two theorems of Grone and Grone & Merris, providing tight bounds and studying the cases of equality. As a consequence, some results on well-known parameters of a graph, such as the maximum and minimum cuts, the edge-connectivity, the (almost) dominating number, and the edge isoperimetric number, are derived.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 24.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 34.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A. E. Brouwer and W. H. Haemers, A lower bound for the Laplacian eigenvalues of a graph—proof of a conjecture by Guo, Linear Algebra Appl. 429 (2008), 2131–2135.

    Article  MATH  MathSciNet  Google Scholar 

  2. A. E. Brouwer and W. H. Haemers, “Spectra of Graphs”, Springer Verlag (Universitext), Heidelberg, 2012; available online at http://homepages.cwi.nl/aeb/math/ipm/.

    Book  Google Scholar 

  3. J.-M. Guo, On the third largest Laplacian eigenvalue of a graph, Linear Multilinear Algebra 55 (2007), 93–102.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. Grone, Eigenvalues and the degree seqences of graphs, Linear Multilinear Algebra 39 (1995), 133–136.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. Grone and R. Merris, The Laplacian spectrum of a graph. II, SIAM J. Discrete Math. 7(2) (1994), 221–229.

    Article  MATH  MathSciNet  Google Scholar 

  6. I. Schur, Über eine Klasse von Mittelbildungen mit Anwendungen die Determinanten, Theorie Sitzungsber, Berlin. Math. Gessellschaft 22 (1923), 9–20.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jaroslav Nešetřil Marco Pellegrini

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Scuola Normale Superiore Pisa

About this paper

Cite this paper

Abiad, A., Fiol, M.A., Haemers, W.H., Perarnau, G. (2013). An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs. In: Nešetřil, J., Pellegrini, M. (eds) The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM Series, vol 16. Edizioni della Normale, Pisa. https://doi.org/10.1007/978-88-7642-475-5_18

Download citation

Publish with us

Policies and ethics