Bounds on median eigenvalues of graphs of bounded degree
Combinatorics
2026-03-31 v1
Abstract
We prove that for every integer , the median eigenvalues of any graph of maximum degree are bounded above by . We also prove that, in three separate cases, the median eigenvalues of a graph of maximum degree are bounded below by : when the graph is triangle-free, when is a perfect square, or when . These results resolve, for all but finitely many values of , an open problem of Mohar on median eigenvalues of graphs of maximum degree . As a byproduct, we establish an upper bound on the average energy of graphs of maximum degree at most , generalizing a previous result of van Dam, Haemers, and Koolen for -regular graphs.
Keywords
Cite
@article{arxiv.2603.27434,
title = {Bounds on median eigenvalues of graphs of bounded degree},
author = {Hricha Acharya and Zilin Jiang and Shengtong Zhang},
journal= {arXiv preprint arXiv:2603.27434},
year = {2026}
}
Comments
16 pages, 1 figure