Perfect State Transfer on gcd-graphs
Abstract
Let be a graph with adjacency matrix . The transition matrix of is denoted by and it is defined by The graph has perfect state transfer (PST) from a vertex to another vertex if there exist such that the -th entry of has unit modulus. In case when , we say that is periodic at the vertex at time . The graph 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 . Using this we deduce that there exists gcd-graph having PST over an abelian group of order divisible by . Also we find a necessary and sufficient condition for a class of gcd-graphs to be periodic at . Using this we characterize a class of gcd-graphs not exhibiting PST at for all positive integers .
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}
}