English

A class of gcd-graphs having Perfect State Transfer

Combinatorics 2019-01-08 v1

Abstract

Let GG be a graph with adjacency matrix AA. The transition matrix corresponding to GG is defined by H(t):=exp(itA)H(t):=\exp{\left(itA\right)}, t\Rlt\in\Rl. The graph GG is said to have perfect state transfer (PST) from a vertex uu to another vertex vv, if there exist τ\Rl\tau\in\Rl such that the uvuv-th entry of H(τ)H(\tau) has unit modulus. The graph GG is said to be periodic at τ\Rl\tau\in\Rl if there exist γ\Cl\gamma\in\Cl with γ=1|\gamma|=1 such that H(τ)=γIH(\tau)=\gamma I, where II is the identity matrix. A gcd\mathit{gcd}-graph is a Cayley graph over a finite abelian group defined by greatest common divisors. In this paper, we construct classes of gcd\mathit{gcd}-graphs having periodicity and perfect state transfer.

Keywords

Cite

@article{arxiv.1601.07398,
  title  = {A class of gcd-graphs having Perfect State Transfer},
  author = {Hiranmoy Pal and Bikash Bhattacharjya},
  journal= {arXiv preprint arXiv:1601.07398},
  year   = {2019}
}
R2 v1 2026-06-22T12:37:49.639Z