English

More Circulant Graphs exhibiting Pretty Good State Transfer

Combinatorics 2019-01-08 v1

Abstract

The transition matrix of a graph GG corresponding to the adjacency matrix AA is defined by H(t):=exp(itA),H(t):=\exp{\left(-itA\right)}, where tRt\in\mathbb{R}. The graph is said to exhibit pretty good state transfer between a pair of vertices uu and vv if there exists a sequence {tk}\left\lbrace t_k\right\rbrace of real numbers such that limkH(tk)eu=γev\lim\limits_{k\rightarrow\infty} H(t_k) {\bf e}_u=\gamma {\bf e}_v, where γ\gamma 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}
}
R2 v1 2026-06-22T19:58:01.926Z