A class of gcd-graphs having Perfect State Transfer
Combinatorics
2019-01-08 v1
Abstract
Let be a graph with adjacency matrix . The transition matrix corresponding to is defined by , . The graph is said to have perfect state transfer (PST) from a vertex to another vertex , if there exist such that the -th entry of has unit modulus. The graph is said to be periodic at if there exist with such that , where is the identity matrix. A -graph is a Cayley graph over a finite abelian group defined by greatest common divisors. In this paper, we construct classes of -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}
}