English

The Eigenvalues of the Graphs $D(4,q)$

Combinatorics 2017-01-16 v1

Abstract

The graphs D(k,q)D(k,q) have connected components CD(k,q)CD(k,q) 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 k=4k=4, the smallest open case. For each prime power qq, the graph D(4,q)D(4,q) is qq-regular graph on 2q42q^4 vertices, all of whose eigenvalues other than ±q\pm q are bounded in absolute value by 2q2\sqrt{q}. Accordingly, these graphs are good expanders, in fact very close to Ramanujan.

Keywords

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}
}
R2 v1 2026-06-22T17:49:37.129Z