Perfect state transfer on -graphs

From MaRDI portal
Publication:4603754



Abstract: Let G be a graph with adjacency matrix A. The transition matrix of G is denoted by H(t) and it is defined by H(t):=expleft(itAight),;tinmathbbR. The graph G has perfect state transfer (PST) from a vertex u to another vertex v if there exist auleft(eq0ight)inmathbbR such that the uv-th entry of H(au) has unit modulus. In case when u=v, we say that G is periodic at the vertex u at time au. The graph G is said to be periodic if it is periodic at all vertices at the same time. A gcd-graph is a Cayley graph over a finite abelian group defined by greatest common divisors. We establish a sufficient condition for a gcd-graph to have periodicity and PST at fracpi2. Using this we deduce that there exists gcd-graph having PST over an abelian group of order divisible by 4. Also we find a necessary and sufficient condition for a class of gcd-graphs to be periodic at pi. Using this we characterize a class of gcd-graphs not exhibiting PST at fracpi2k for all positive integers k.





Cited in
(37)








This page was built for publication: Perfect state transfer on \(\gcd\)-graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603754)