2000 character limit reached
On the eigenvalues of cyclic covers of Paley graphs
Published 17 Jan 2026 in math.CO and math.NT | (2601.11877v1)
Abstract: We study covering graphs of the Paley graph associated to a finite field of characteristic p in the case where the covering transformation group is cyclic of prime order distinct from p. When the field has q = p elements, we show that the eigenvalues of the adjacency matrix determine the graph isomorphism class among translation invariant covers. When q = pr > p, we construct examples of cospectral covering graphs that are not isomorphic as graphs.
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.