Bounds on median eigenvalues of graphs of bounded degree

Abstract

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

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…