Exceptional graphs with smallest eigenvalue -2 and related problems

DOI10.1090/S0025-5718-1992-1134718-6zbMath0770.05060OpenAlexW2119298654WikidataQ56001781 ScholiaQ56001781MaRDI QIDQ4031584

Arnold Neumaier, Bussemaker, Frans C.

Publication date: 1 April 1993

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-1992-1134718-6

zbMATH Keywords

distance-regular graphsdiametersmallest eigenvalueintersection array

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Algebraic combinatorics (05E99) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items

Designs over regular graphs with least eigenvalue \(-2\), Representation of signed graphs by root system \(E_ 8\), Approximation and inapproximability results for maximum clique of disc graphs in high dimensions, On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\), Star complements and exceptional graphs, The maximal exceptional graphs, The line graphs of lollipop graphs are determined by their spectra, Derived eigenvalues of symmetric matrices, with applications to distance geometry, Dual polar spaces as extremal distance-regular graphs., The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs, Edge-signed graphs with smallest eigenvalue greater than \(-2\), A characterization of Johnson and Hamming graphs and proof of Babai's conjecture, Signed graphs with least eigenvalue \(<-2\), A new infinite series of regular uniformly geodetic code graphs, On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\), Graphs with least eigenvalue \(-2\): The star complement technique, On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes, Open problems in the spectral theory of signed graphs, Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey, Nonregular graphs with three eigenvalues, The 2-partially distance-regular graphs such that their second largest local eigenvalues are at most one, On graphs with three eigenvalues, 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On spectral characterization and embeddings of graphs
• A class of distance-regular graphs that are \(\phi\)-polynomial
• Distance-regular graphs with girth 3 or 4: I
• A new feasibility condition for distance-regular graphs
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
• Characterization of H(n,q) by the parameters
• Graphs with eigenvalues at least - 2
• A surprising property of the least eigenvalue of a graph
• Line graphs, root systems, and elliptic geometry
• On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
• Root systems and the Johnson and Hamming graphs
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• A graph polynomial and its applications
• An interrelation between line graphs, eigenvalues, and matroids
• Equiangular lines
• Spiegelungsgruppen und Aufzählung halbeinfacher Liescher Ringe
• The Uniqueness of the $\mathrm{L}_2$ Association Scheme
• Lattices of Simplex Type
• Characerization of a class of distance regular graphs.
• Locally 4-by-4 grid graphs
• Generalized line graphs
• Regular 2-Graphs
• Extreme Forms