On Graphs with the Smallest Eigenvalue at Least -1-√(2), part II

2011/10/06 by Tetsuji Taniguchi, Taniguchi, Tetsuji
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #graph theory and CDMA systems #math.CO

paper · pdf · doi:10.48550/arxiv.1110.1240

16 pages

arxiv created 2011/10/06 · openalex publication_date 2011/10/06 · arxiv updated 2011/10/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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-√(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.

Related

• Graphs with second largest eigenvalue less than 1/2
• Recent progress on graphs with fixed smallest eigenvalue
• Beyond the classification theorem of Cameron, Goethals, Seidel, and Shult
• Mixed graphs with smallest eigenvalue greater than -(√(5)+1)/(2)
• Least Q-eigenvalues of nonbipartite 2-connected graphs