
arXiv: 1804.00369
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.
Connectivity, Graphs and linear algebra (matrices, eigenvalues, etc.), Hoffman graph, \(s\)-integrability, 05C50, 11H99, Geometry of numbers, root lattice, FOS: Mathematics, eigenvalue, Mathematics - Combinatorics, Combinatorics (math.CO), lattice
Connectivity, Graphs and linear algebra (matrices, eigenvalues, etc.), Hoffman graph, \(s\)-integrability, 05C50, 11H99, Geometry of numbers, root lattice, FOS: Mathematics, eigenvalue, Mathematics - Combinatorics, Combinatorics (math.CO), lattice
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 15 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
