The Eigenvalues of the Graphs $D(4,q)$
Combinatorics
2017-01-16 v1
Abstract
The graphs have connected components giving the best known bounds on extremal problems with {\em forbidden\/} even cycles, and are denser than the well-known graphs of Lubotzky, Phillips, Sarnak and Margulis. Despite this, little about the spectrum and expansion properties of these graphs is known. In this paper we find the spectrum for , the smallest open case. For each prime power , the graph is -regular graph on vertices, all of whose eigenvalues other than are bounded in absolute value by . Accordingly, these graphs are good expanders, in fact very close to Ramanujan.
Cite
@article{arxiv.1701.03685,
title = {The Eigenvalues of the Graphs $D(4,q)$},
author = {G. Eric Moorhouse and Shuying Sun and Jason Williford},
journal= {arXiv preprint arXiv:1701.03685},
year = {2017}
}