Graphs with Exactly Two Negative Eigenvalues

In this paper we determine all finite connected graphs whose spectrum contains exactly two negative eigenvalues. The main theorem says that a graph has exactly two negative eigenvalues if and only if its “canonical graph” (defined below) is one of nine particular graphs on 3, 4, 5 and 6 vertices.