On Graphs with the Smallest Eigenvalue at Least -1-sqrt{2}, part II
classification
🧮 math.CO
keywords
graphseigenvaluegraphleastpartsamesmallestsqrt
read the original abstract
This is a continuation of the article with the same title. In this paper, the family H is the same as in the previous paper "On Graphs with the Smallest Eigenvalue at Least $-1-\sqrt{2}$, part I". The main result is that a minimal graph which is not an H -line graph, is just isomorphic to one of the 38 graphs found by computer.
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.