Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem

DOI10.1007/s10623-004-4856-5zbMath1063.05090OpenAlexW1998386707MaRDI QIDQ1766108

Peter Rowlinson, Dragos Cvetković, Slobodan K. Simic

Publication date: 28 February 2005

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-004-4856-5

zbMATH Keywords

graph spectrumgeneralized line graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (5)

Equivalence of four descriptions of generalized line graphs ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ Slobodan Simić: an appreciation ⋮ Some observations on the smallest adjacency eigenvalue of a graph ⋮ From finite line graphs to infinite derived signed graphs

Cites Work

• Unnamed Item
• On spectral characterization and embeddings of graphs
• A table of connected graphs on six vertices
• Graphs with eigenvalues at least - 2
• Line graphs, root systems, and elliptic geometry
• Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs
• Generalized line graphs
• Characterizations of derived graphs
• Graphs with least eigenvalue \(-2\): The star complement technique

This page was built for publication: Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem