2000 character limit reached
Eigenvalues of graphs and spectral Moore theorems
Published 20 Apr 2020 in math.CO and cs.DM | (2004.09221v1)
Abstract: In this paper, we describe some recent spectral Moore theorems related to determining the maximum order of a connected graph of given valency and second eigenvalue. We show how these spectral Moore theorems have applications in Alon-Boppana theorems for regular graphs and in the classical degree-diameter/Moore problem.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.