On the limit points of the smallest eigenvalues of regular graphs
Hyonju Yu

TL;DR
This paper explores the range of smallest eigenvalues in regular graphs, providing infinite examples in specific intervals, identifying limit points, and characterizing extremal graphs with eigenvalues less than -2.
Contribution
It introduces infinite families of regular graphs with smallest eigenvalues in particular intervals and determines key limit points and extremal graphs for eigenvalues below -2.
Findings
Identifies infinite examples of regular graphs with eigenvalues in specific intervals.
Determines the largest and second largest limit points of smallest eigenvalues less than -2.
Characterizes the unique 3-regular graph with the maximum smallest eigenvalue below -2.
Abstract
In this paper, we give infinitely many examples of (non-isomorphic) connected -regular graphs with smallest eigenvalue in half open interval and also infinitely many examples of (non-isomorphic) connected -regular graphs with smallest eigenvalue in half open interval where is the smallest root of the polynomial . 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Finite Group Theory Research · Synthesis and Properties of Aromatic Compounds
