Ramanujan Cayley Graphs with Normal Connection Sets in Ratio-One Frobenius Groups
arXiv:2608.19905
Abstract
Let be a finite Frobenius group with and . We classify all Ramanujan Cayley graphs of whose connection sets are normal, in the sense of being unions of conjugacy classes. The group-theoretic input is a simple blow-up phenomenon: every such Cayley graph is either or for a connected regular Cayley graph on the complement . We first prove a graph-theoretic result classifying all Ramanujan graphs of these two forms when is an arbitrary connected regular graph on vertices. The proof combines the classical characterization of regular graphs with least eigenvalue greater than with a second-moment identity in the bipartite case. Translating the resulting five graph types back to yields a complete classification for all ratio-one Frobenius groups, and in particular for over every finite field.
8 pages