A structure theory for graphs with fixed smallest eigenvalue

DOI10.1016/j.laa.2016.03.044zbMath1336.05089OpenAlexW2335617631MaRDI QIDQ286130

Jae Young Yang, Hyun Kwang Kim, Jack H. Koolen

Publication date: 20 May 2016

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

Full work available at URL: https://doi.org/10.1016/j.laa.2016.03.044

zbMATH Keywords

smallest eigenvaluestructure theoryquasi-cliqueHoffman graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

A generalization of a theorem of Neumaier ⋮ Sesqui-regular graphs with fixed smallest eigenvalue ⋮ A generalization of a theorem of Hoffman ⋮ On the order of regular graphs with fixed second largest eigenvalue ⋮ On graphs with smallest eigenvalue at least \(-3\) and their lattices ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
• On fat Hoffman graphs with smallest eigenvalue at least -3

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