The Laplacian spectral excess theorem for distance-regular graphs

E.R. van Dam, M.A. Fiol

Research output: Contribution to journalArticleScientificpeer-review

4 Citations (Scopus)
353 Downloads (Pure)


The spectral excess theorem states that, in a regular graph Γ, the average excess, which is the mean of the numbers of vertices at maximum distance from a vertex, is bounded above by the spectral excess (a number that is computed by using the adjacency spectrum of Γ), and Γ is distance-regular if and only if equality holds. In this note we prove the corresponding result by using the Laplacian spectrum without requiring regularity of Γ.
Original languageEnglish
Pages (from-to)245-250
JournalLinear Algebra and its Applications
Early online date24 Jun 2014
Publication statusPublished - 1 Oct 2014


  • Distance-regular graphs
  • spectral excess theorem
  • Laplacian spectrum
  • orthogonal polynomials


Dive into the research topics of 'The Laplacian spectral excess theorem for distance-regular graphs'. Together they form a unique fingerprint.

Cite this