On the limit points of the smallest eigenvalues of regular graphs
Abstract
In this paper, we give infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [-1-2, -2) and also infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [α1, -1-2) where α1 is the smallest root(≈ -2.4812) of the polynomial x3+2x2-2x-2. From these results, we determine the largest and second largest limit points of smallest eigenvalues of regular graphs less than -2. Moreover we determine the supremum of the smallest eigenvalue among all connected 3-regular graphs with smallest eigenvalue less than -2 and we give the unique graph with this supremum value as its smallest eigenvalue.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.