Median eigenvalues of subcubic graphs
Combinatorics
2025-04-21 v2
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 in absolute value, resolving open problems posed by Fowler and Pisanski, and by Mohar.
Keywords
Cite
@article{arxiv.2502.13139,
title = {Median eigenvalues of subcubic graphs},
author = {Hricha Acharya and Benjamin Jeter and Zilin Jiang},
journal= {arXiv preprint arXiv:2502.13139},
year = {2025}
}
Comments
54 pages, 170 figures --- they say a picture is worth a thousand words. This paper is worth... well, you do the math