Exceptional graphs with smallest eigenvalue -2 and related problems

F.C. Bussemaker, A. Neumaier

Research output: Contribution to journalArticleAcademicpeer-review

31 Citations (Scopus)


This paper summarizes the known results on graphs with smallest eigenvalue around -2, and completes the theory by proving a number of new results, giving comprehensive tables of the finitely many exceptions, and posing some new problems. Then the theory is applied to characterize a class of distance-regular graphs of large diameter by their intersection array.
Original languageEnglish
Pages (from-to)583-608
Number of pages26
JournalMathematics of Computation
Issue number200
Publication statusPublished - 1992


Dive into the research topics of 'Exceptional graphs with smallest eigenvalue -2 and related problems'. Together they form a unique fingerprint.

Cite this