State Transfer on Unitary Cayley Graphs and Quadratic Unitary Cayley Graphs
Abstract
The unitary Cayley graph, denoted Xn, is the graph with vertex set Zn such that two distinct vertices a and b are adjacent if a-b=u for some u with 1 ≤ u ≤ n-1 and (u,n) = 1. The quadratic unitary Cayley graph, denoted Gn, is the graph with vertex set Zn such that two distinct vertices a and b are adjacent if a-b=u2 or a-b=-u2 for some u with 1 ≤ u ≤ n-1 and (u,n) = 1. In this paper, we classify all Xn admitting pretty good fractional. We also classify all Xn that admit fractional revival. It turns out that Xn admits fractional revival if and only if it admits pretty good fractional revival. Further, we classify all Gn admitting periodicity. As a consequence, we obtain all Gn admitting perfect state transfer. We also classify Gn admitting pretty good state transfer, pretty good fractional revival and fractional revival.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.