On Graphs with the Smallest Eigenvalue at Least $-1-\sqrt{2}$, part II

Details On Graphs with the Smallest Eigenvalue at Least $-1-\sqrt{2}$, part II On Graphs with the Smallest Eigenvalue at Least $-1-\sqrt{2}$, part II

2011-10-06

arxiv.org/abs/1110.1240v1

Mathematics

Combinatorics

16 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Graphs with the Smallest Eigenvalue at Least $-1-\sqrt{2}$, part II does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Graphs with the Smallest Eigenvalue at Least $-1-\sqrt{2}$, part II, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Graphs with the Smallest Eigenvalue at Least $-1-\sqrt{2}$, part II will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-181457