The largest two Laplacian eigenvalues of a graph

Research output: Contribution to journalArticlepeer-review

Abstract

In this article, we present lower bounds for the largest eigenvalue, the second largest eigenvalue and the sum of the two largest eigenvalues of the Laplacian matrix of a graph.

Original languageEnglish
Pages (from-to)441-460
Number of pages20
JournalLinear and Multilinear Algebra
Volume52
Issue number6
DOIs
StatePublished - Dec 2004
Externally publishedYes

Keywords

  • Graph
  • Laplacian matrix
  • Lower bound
  • The largest eigenvalue
  • The second largest eigenvalue

Fingerprint

Dive into the research topics of 'The largest two Laplacian eigenvalues of a graph'. Together they form a unique fingerprint.

Cite this