A structure theory for regular graphs with fixed smallest eigenvalue

DOI10.1016/J.LAA.2025.05.013MaRDI QIDQ6963345zbMATH OpenFDO

Authors Qianqian Yang, Jack H. Koolen

Publication date 7 July 2025

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

Full work available at URL https://doi.org/10.1016/J.LAA.2025.05.013

zbMATH Keywords

cliqueHoffman graphsregular graphsmallest eigenvaluestructure theory

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• A generalization of a theorem of Hoffman
• A structure theory for graphs with fixed smallest eigenvalue
• Augmenting the Delsarte bound: a forbidden interval for the order of maximal cliques in strongly regular graphs
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• Line graphs, root systems, and elliptic geometry
• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
• On the limit points of the smallest eigenvalues of regular graphs
• Some remarks on the parameter \(c_2\) for a distance-regular graph with classical parameters
• The Existence and Construction of Balanced Incomplete Block Designs

Cited in

(2)

• A characterization of the Grassmann graphs: one missing case
• A Bose-Laskar-Hoffman theory for -bounded graphs with fixed smallest eigenvalue

This page was built for publication: A structure theory for regular graphs with fixed smallest eigenvalue

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