Advertisement

Graphs with Few Eigenvalues

  • Andries E. Brouwer
  • Willem H. Haemers
Chapter
  • 3.3k Downloads
Part of the Universitext book series (UTX)

Abstract

Graphs with few distinct eigenvalues tend to have some kind of regularity. A graph with only one eigenvalue (for A, L, or Q) is edgeless, and a connected graph with two distinct adjacency eigenvalues (for A, L, or Q) is complete.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Andries E. Brouwer and Willem H. Haemers 2012

Authors and Affiliations

  • Andries E. Brouwer
    • 1
  • Willem H. Haemers
    • 2
  1. 1.Department of MathematicsEindhoven University of TechnologyEindhovenThe Netherlands
  2. 2.Department of Econometrics and Operations ResearchTilburg UniversityTilburgThe Netherlands

Personalised recommendations