English

Perfect State Transfer on gcd-graphs

Combinatorics 2019-01-08 v2

Abstract

Let GG be a graph with adjacency matrix AA. The transition matrix of GG is denoted by H(t)H(t) and it is defined by H(t):=exp(itA),  tR.H(t):=\exp{\left(itA\right)},\;t\in\mathbb{R}. The graph GG has perfect state transfer (PST) from a vertex uu to another vertex vv if there exist τ(0)R\tau\left(\neq0\right)\in\mathbb{R} such that the uvuv-th entry of H(τ)H(\tau) has unit modulus. In case when u=vu=v, we say that GG is periodic at the vertex uu at time τ\tau. The graph GG is said to be periodic if it is periodic at all vertices at the same time. A gcd-graph is a Cayley graph over a finite abelian group defined by greatest common divisors. We establish a sufficient condition for a gcd-graph to have periodicity and PST at π2\frac{\pi}{2}. Using this we deduce that there exists gcd-graph having PST over an abelian group of order divisible by 44. Also we find a necessary and sufficient condition for a class of gcd-graphs to be periodic at π\pi. Using this we characterize a class of gcd-graphs not exhibiting PST at π2k\frac{\pi}{2^{k}} for all positive integers kk.

Keywords

Cite

@article{arxiv.1601.07647,
  title  = {Perfect State Transfer on gcd-graphs},
  author = {Hiranmoy Pal and Bikash Bhattacharjya},
  journal= {arXiv preprint arXiv:1601.07647},
  year   = {2019}
}
R2 v1 2026-06-22T12:38:19.331Z