加载中…
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 $\lim\limits_{k\rightarrow\infty} H(t_k) {\bf e}_u=\gamma {\bf e}_v\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.

生成讲解博客的中文版本

生成AI智能校验的中文版本