English

State Transfer on Unitary Cayley Graphs and Quadratic Unitary Cayley Graphs

Combinatorics 2025-08-26 v1

Abstract

The unitary Cayley graph, denoted XnX_n, is the graph with vertex set Zn{\mathbb{Z}}_n such that two distinct vertices aa and bb are adjacent if ab=ua-b=u for some uu with 1un11 \leq u \leq n-1 and gcd(u,n)=1\gcd(u,n) = 1. The quadratic unitary Cayley graph, denoted GnG_n, is the graph with vertex set Zn{\mathbb{Z}}_n such that two distinct vertices aa and bb are adjacent if ab=u2a-b=u^2 or ab=u2a-b=-u^2 for some uu with 1un11 \leq u \leq n-1 and gcd(u,n)=1\gcd(u,n) = 1. In this paper, we classify all XnX_n admitting pretty good fractional. We also classify all XnX_n that admit fractional revival. It turns out that XnX_n admits fractional revival if and only if it admits pretty good fractional revival. Further, we classify all GnG_n admitting periodicity. As a consequence, we obtain all GnG_n admitting perfect state transfer. We also classify GnG_n admitting pretty good state transfer, pretty good fractional revival and fractional revival.

Keywords

Cite

@article{arxiv.2508.18068,
  title  = {State Transfer on Unitary Cayley Graphs and Quadratic Unitary Cayley Graphs},
  author = {Akash Kalita and Bikash Bhattacharjya},
  journal= {arXiv preprint arXiv:2508.18068},
  year   = {2025}
}

Comments

NA