Edge-regular graphs with fixed smallest eigenvalue with an application to Neumaier graphs
The authors establish significant structural results for edge-regular graphs with bounded smallest eigenvalue and large valency, using the theory of Hoffman graphs. The authors prove that such graphs exhibit rigid quasi-clique decompositions and apply this to show that there exist only finitely many strictly Neumaier graphs with smallest eigenvalue at least \(-3\). The methods combine spectral graph theory with intricate structural analysis, extending known results about line graphs and quasi-cliques. While the paper contributes to the classification of Neumaier graphs, its techniques may also find broader application in the spectral analysis of regular graphs.
- A generalization of a theorem of Hoffman
- A structure theory for graphs with fixed smallest eigenvalue
- An infinite class of Neumaier graphs and non-existence results
- Another construction of edge-regular graphs with regular cliques
- Edge-regular graphs with regular cliques
- Generalized line graphs
- scientific article; zbMATH DE number 3730160 (Why is no real title available?)
- Line graphs, root systems, and elliptic geometry
- Neumaier graphs with few eigenvalues
- On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
- On graphs with smallest eigenvalue at least \(-3\) and their lattices
- The smallest strictly Neumaier graph and its generalisations
This page was built for publication: Edge-regular graphs with fixed smallest eigenvalue with an application to Neumaier graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6998697)
