Median eigenvalues of subcubic graphs
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.