Cubic graphs with no eigenvalues in the interval (-1,1)
Krystal Guo, Gordon F. Royle

TL;DR
This paper fully characterizes cubic graphs that lack eigenvalues in the interval (-1,1), identifying infinite families and sporadic cases, and establishes that (-1,1) is the maximal spectral gap for such graphs.
Contribution
It provides a complete classification of cubic graphs with no eigenvalues in (-1,1), combining known families and new sporadic examples, and proves the maximality of this spectral gap.
Findings
Identified two infinite families of such graphs.
Discovered 14 sporadic graphs with at most 32 vertices.
Proved (-1,1) is the maximal spectral gap for cubic graphs.
Abstract
We give a complete characterisation of the cubic graphs with no eigenvalues in the open interval . There are two infinite families, one due to Guo and Mohar [Linear Algebra Appl. 449:68--75] the other due to Koll\'ar and Sarnak [Communications of the AMS. 1,1--38], and "sporadic" graphs on at most vertices. This allows us to show that is a maximal spectral gap set for cubic graphs. Our techniques including examination of various substructure and an application of the classification of generalized line graphs.
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 · Graph Labeling and Dimension Problems · Finite Group Theory Research
