On graphs with smallest eigenvalue at least -3 and their lattices
classification
🧮 math.CO
keywords
eigenvalueleastsmallestconnectedgraphsresultdegreeenough
read the original abstract
In this paper, we show that a connected graph with smallest eigenvalue at least -3 and large enough minimal degree is 2-integrable. This result generalizes a 1977 result of Hoffman for connected graphs with smallest eigenvalue at least -2.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.