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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.