More Circulant Graphs exhibiting Pretty Good State Transfer
Combinatorics
2019-01-08 v1
Abstract
The transition matrix of a graph corresponding to the adjacency matrix is defined by where . The graph is said to exhibit pretty good state transfer between a pair of vertices and if there exists a sequence of real numbers such that , where is a complex number of unit modulus. We classify some circulant graphs exhibiting or not exhibiting pretty good state transfer. This generalize several pre-existing results on circulant graphs admitting pretty good state transfer.
Keywords
Cite
@article{arxiv.1705.08859,
title = {More Circulant Graphs exhibiting Pretty Good State Transfer},
author = {Hiranmoy Pal},
journal= {arXiv preprint arXiv:1705.08859},
year = {2019}
}