On Graphs with the Smallest Eigenvalue at Least $-1-\sqrt{2}$, part II
Combinatorics
2011-10-07 v1
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 , 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.
Keywords
Cite
@article{arxiv.1110.1240,
title = {On Graphs with the Smallest Eigenvalue at Least $-1-\sqrt{2}$, part II},
author = {Tetsuji Taniguchi},
journal= {arXiv preprint arXiv:1110.1240},
year = {2011}
}
Comments
16 pages