Papers
Topics
Authors
Recent
Search
2000 character limit reached

State Transfer on Unitary Cayley Graphs and Quadratic Unitary Cayley Graphs

Published 25 Aug 2025 in math.CO | (2508.18068v1)

Abstract: The unitary Cayley graph, denoted $X_n$, is the graph with vertex set ${\mathbb{Z}}_n$ such that two distinct vertices $a$ and $b$ are adjacent if $a-b=u$ for some $u$ with $1 \leq u \leq n-1$ and $\gcd(u,n) = 1$. The quadratic unitary Cayley graph, denoted $G_n$, is the graph with vertex set ${\mathbb{Z}}_n$ such that two distinct vertices $a$ and $b$ are adjacent if $a-b=u2$ or $a-b=-u2$ for some $u$ with $1 \leq u \leq n-1$ and $\gcd(u,n) = 1$. In this paper, we classify all $X_n$ admitting pretty good fractional. We also classify all $X_n$ that admit fractional revival. It turns out that $X_n$ admits fractional revival if and only if it admits pretty good fractional revival. Further, we classify all $G_n$ admitting periodicity. As a consequence, we obtain all $G_n$ admitting perfect state transfer. We also classify $G_n$ admitting pretty good state transfer, pretty good fractional revival and fractional revival.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.