An inequality involving the second largest and smallest eigenvalue of a distance-regular graph

Jack H. Koolen, Jongyook Park, Hyonju Yu

Research output: Contribution to journalArticlepeer-review

23 Scopus citations

Abstract

For a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) θ1 (resp., θD) we show that (θ1+1)(θD+1)≤-b1 holds, where equality only holds when the diameter equals two. Using this inequality we study distance-regular graphs with fixed second largest eigenvalue.

Original languageEnglish
Pages (from-to)2404-2412
Number of pages9
JournalLinear Algebra and Its Applications
Volume434
Issue number12
DOIs
StatePublished - 15 Jun 2011

Keywords

  • Bounds on eigenvalues
  • Distance-regular graph
  • Shill distance-regular graphs
  • Tight distance-regular graph

Fingerprint

Dive into the research topics of 'An inequality involving the second largest and smallest eigenvalue of a distance-regular graph'. Together they form a unique fingerprint.

Cite this