Ramanujan graphs arising as weighted Galois covering graphs

Marvin Minei (Pacific Missile Range Facility, Department of Navy, Barking Sands, HI 96752.)
Howard Skogman (Department of Mathematics, College at Brockport, SUNY, Brockport, NY 14420.)

Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 6, No 1 (2018): Electronic Journal of Graph Theory and Applications

We give a new construction of Ramanujan graphs using a generalized type of covering graph called a weighted covering graph. For a given prime p the basic construction produces bipartite Ramanujan graphs with 4p vertices and degrees 2N where roughly $p + 1 - \sqrt{2p} < N \le p$. We then give generalizations to produce Ramanujan graphs of other sizes and degrees as well as general results about base graphs which have weighted covers that satisfy their Ramanujan bounds. To do the construction, we define weighted covering graphs and distinguish a subclass of Galois weighted covers that allows for block diagonalization of the adjacency matrix. The specific construction allows for easy computation of the resulting blocks. The Gershgorin Circle Theorem is then used to compute the Ramanujan bounds on the spectra.