On graphs with the smallest eigenvalue at least -1 - √2, Part II

Abstract

This is a continuation of the article with the same title. In this paper, the family ℋ is the same as in the previous paper [T. Taniguchi, On graphs with the smallest eigenvalue at least −1 − √2, part I, Ars Math. Contemp 1 (2008), 81-98]. The main result is that a minimal graph which is not an ℋ-line graph, is just isomorphic to one of the 38 graphs found by computer.