An application of Hoffman graphs for spectral characterizations of graphs
From MaRDI portal
Publication:510321
zbMath1355.05163arXiv1608.08800MaRDI QIDQ510321
Aida Abiad, Jack H. Koolen, Qianqian Yang
Publication date: 17 February 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.08800
Related Items
A spectral characterization of the \(s\)-clique extension of the square grid graphs, A generalization of a theorem of Hoffman, Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Distance-regular graphs
- On the limit points of the smallest eigenvalues of regular graphs
- Edge-signed graphs with smallest eigenvalue greater than \(-2\)
- Spectral characterization of the Hamming graphs
- Which graphs are determined by their spectrum?
- A generalization of a theorem of Hoffman
- Regular graphs with four eigenvalues
- On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
- Interlacing eigenvalues and graphs
- On fat Hoffman graphs with smallest eigenvalue at least -3
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
- On the Polynomial of a Graph
- Godsil-McKay switching and isomorphism
