English

Bounds on median eigenvalues of graphs of bounded degree

Combinatorics 2026-03-31 v1

Abstract

We prove that for every integer d3d \ge 3, the median eigenvalues of any graph of maximum degree dd are bounded above by d1\sqrt{d-1}. We also prove that, in three separate cases, the median eigenvalues of a graph of maximum degree dd are bounded below by d1-\sqrt{d-1}: when the graph is triangle-free, when d1d-1 is a perfect square, or when d75d \ge 75. These results resolve, for all but finitely many values of dd, an open problem of Mohar on median eigenvalues of graphs of maximum degree dd. As a byproduct, we establish an upper bound on the average energy of graphs of maximum degree at most dd, generalizing a previous result of van Dam, Haemers, and Koolen for dd-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