A generalization of a theorem of Hoffman

DOI10.1016/j.jctb.2018.07.009zbMath1404.05111arXiv1612.07085OpenAlexW2963470498MaRDI QIDQ1719574

Qianqian Yang, Jae Young Yang, Jack H. Koolen

Publication date: 8 February 2019

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.07085

zbMATH Keywords

hypergraphJohnson graphHamming graphintersection graphsmallest eigenvalueHoffman graph2-clique extension of grid graph

Mathematics Subject Classification ID

Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (5)

A spectral characterization of the \(s\)-clique extension of the square grid graphs ⋮ The spectral radius of minor-free graphs ⋮ An application of Hoffman graphs for spectral characterizations of graphs ⋮ On fat Hoffman graphs with smallest eigenvalue at least \(-3\). II ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey

Cites Work

• Unnamed Item
• A structure theory for graphs with fixed smallest eigenvalue
• An application of Hoffman graphs for spectral characterizations of graphs
• Characterizing distance-regularity of graphs by the spectrum
• Spectral characterization of the Hamming graphs
• Line graphs, root systems, and elliptic geometry
• On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
• On graphs with smallest eigenvalue at least \(-3\) and their lattices
• Regular graphs with four eigenvalues
• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
• On fat Hoffman graphs with smallest eigenvalue at least -3
• A graph‐theoretic generalization of the clique concept

This page was built for publication: A generalization of a theorem of Hoffman