Graphs with least eigenvalue \(-2\): The star complement technique

DOI10.1023/A:1011209801191zbMath0982.05065OpenAlexW1484562090MaRDI QIDQ5949011

Dragos Cvetković, Peter Rowlinson, Slobodan K. Simic

Publication date: 29 March 2002

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011209801191

zbMATH Keywords

grapheigenvalueeigenspaceexceptional graphs

Mathematics Subject Classification ID

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

Related Items (22)

Signed line graphs with least eigenvalue -2: the star complement technique ⋮ EMBEDDINGS OF COMPLEX LINE SYSTEMS AND FINITE REFLECTION GROUPS ⋮ A note on the multiplicities of the eigenvalues of a tree ⋮ On the multiplicity of positive eigenvalues of a graph ⋮ How does Sudoku acquire integral eigenvalues? ⋮ Star complements and exceptional graphs ⋮ Unnamed Item ⋮ A recursive construction of the regular exceptional graphs with least eigenvalue \(-2\) ⋮ The maximal exceptional graphs ⋮ Graph spectra in computer science ⋮ A note on the multiplicities of graph eigenvalues ⋮ On graphs whose star complement for \(-2\) is a path or a cycle ⋮ On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\) ⋮ Star complements in regular graphs: old and new results ⋮ Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem ⋮ The least eigenvalue of the complements of trees ⋮ Unnamed Item ⋮ The enumeration of spanning tree of weighted graphs ⋮ Slobodan Simić: an appreciation ⋮ On the multiplicity of eigenvalues of trees ⋮ Star complements and switching in graphs ⋮ Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On spectral characterization and embeddings of graphs
• A table of connected graphs on six vertices
• On graphs with multiple eigenvalues
• Characterizing line graphs by star complements
• Recent results in the theory of graph spectra
• Line graphs, root systems, and elliptic geometry
• The maximal exceptional graphs
• Some characterizations of graphs by star complements
• A study of eigenspaces of graphs
• An interrelation between line graphs, eigenvalues, and matroids
• Generalized line graphs
• Exceptional graphs with smallest eigenvalue -2 and related problems
• Some additions to the theory of star partitions of graphs

This page was built for publication: Graphs with least eigenvalue \(-2\): The star complement technique