A class of gcd-graphs having Perfect State Transfer

Abstract

Let G be a graph with adjacency matrix A. The transition matrix corresponding to G is defined by H(t):=(itA), t∈. The graph G is said to have perfect state transfer (PST) from a vertex u to another vertex v, if there exist τ∈ such that the uv-th entry of H(τ) has unit modulus. The graph G is said to be periodic at τ∈ if there exist γ∈ with |γ|=1 such that H(τ)=γ I, where I is the identity matrix. A gcd-graph is a Cayley graph over a finite abelian group defined by greatest common divisors. In this paper, we construct classes of gcd-graphs having periodicity and perfect 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.

Discussion (0)

Sign in to join the discussion.

Loading comments…