On graphs with smallest eigenvalue at least −3 and their lattices

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.