Graphs with least eigenvalue -2; a historical survey and recent developments in maximal exceptional graphs

DOI10.1016/S0024-3795(02)00377-4MaRDI QIDQ1855399zbMATH OpenOpenAlexWikidataFDO

Publication date 5 February 2003

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0024-3795(02)00377-4

characterization eigenvalue exceptional graph generalized line graph root systems spectrum of a graph star complement technique

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Review text

Connected graphs with least eigenvalue at least \(-2\) are either generalized line graphs or so-called exceptional graphs. The author surveys a variety of results in the study of these graphs and reports on the recent characterization of all (maximal) exceptional graphs independently accomplished by two groups of researchers one of which containing him. The basic techniques used for this characterization are the use of representations of the graphs using root systems known from the theory of Lie algebras and the so-called star complement technique. The author sketches a proof that all exceptional graphs, except for the cone over \(L(K_8)\), can be obtained by the star complement technique from a unique (exceptional) star complement for the eigenvalue \(-2\).

Recommendations

Cites work

Cited in

(15)

This page was built for publication: Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1855399)