2000 character limit reached
Median eigenvalues of subcubic graphs
Published 18 Feb 2025 in math.CO | (2502.13139v2)
Abstract: We show that the median eigenvalues of every connected graph of maximum degree at most three, except for the Heawood graph, are at most $1$ in absolute value, resolving open problems posed by Fowler and Pisanski, and by Mohar.
Paper Prompts
Sign up for free to create and run prompts on this paper.