More Circulant Graphs exhibiting Pretty Good State Transfer
Abstract
The transition matrix of a graph G corresponding to the adjacency matrix A is defined by H(t):=(-itA), where t∈R. The graph is said to exhibit pretty good state transfer between a pair of vertices u and v if there exists a sequence tk of real numbers such that k→∞ H(tk) eu=γ ev, 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.