2000 character limit reached
Cubic graphs with no eigenvalues in the interval (-1,1)
Published 4 Sep 2024 in math.CO | (2409.02678v1)
Abstract: We give a complete characterisation of the cubic graphs with no eigenvalues in the open interval $(-1,1)$. 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 $14$ "sporadic" graphs on at most $32$ vertices. This allows us to show that $(-1,1)$ 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.