Exceptional graphs with smallest eigenvalue -2 and related problems

F.C. Bussemaker; A. Neumaier

doi:10.1090/S0025-5718-1992-1134718-6

Exceptional graphs with smallest eigenvalue -2 and related problems

F.C. Bussemaker, A. Neumaier

Discrete Mathematics

Research output: Contribution to journal › Article › Academic › peer-review

32 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	583-608
Number of pages	26
Journal	Mathematics of Computation
Volume	59
Issue number	200
DOIs	https://doi.org/10.1090/S0025-5718-1992-1134718-6
Publication status	Published - 1992

Access to Document

10.1090/S0025-5718-1992-1134718-6

Cite this

@article{5072e87201584d3e98dac1710afae756,

title = "Exceptional graphs with smallest eigenvalue -2 and related problems",

abstract = "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.",

author = "F.C. Bussemaker and A. Neumaier",

year = "1992",

doi = "10.1090/S0025-5718-1992-1134718-6",

language = "English",

volume = "59",

pages = "583--608",

journal = "Mathematics of Computation",

issn = "0025-5718",

publisher = "American Mathematical Society",

number = "200",

}

TY - JOUR

T1 - Exceptional graphs with smallest eigenvalue -2 and related problems

AU - Bussemaker, F.C.

AU - Neumaier, A.

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

U2 - 10.1090/S0025-5718-1992-1134718-6

DO - 10.1090/S0025-5718-1992-1134718-6

M3 - Article

SN - 0025-5718

VL - 59

SP - 583

EP - 608

JO - Mathematics of Computation

JF - Mathematics of Computation

IS - 200

ER -

Exceptional graphs with smallest eigenvalue -2 and related problems

Abstract

Access to Document

Fingerprint

Cite this