A class of \textit{gcd}-graphs having perfect state transfer

Publication date: 19 October 2016

Abstract: Let

G

be a graph with adjacency matrix

A

. The transition matrix corresponding to

G

is defined by

H (t) := e x p l e f t (i t A i g h t)

,

t i n R l

. The graph

G

is said to have perfect state transfer (PST) from a vertex

u

to another vertex

v

, if there exist

a u i n R l

such that the

u v

-th entry of

H (a u)

has unit modulus. The graph

G

is said to be periodic at

a u i n R l

if there exist

g a m m a i n C l

with

| g a m m a | = 1

such that

H (a u) = g a m m a I

, where

I

is the identity matrix. A

m a t h i t g c d

-graph is a Cayley graph over a finite abelian group defined by greatest common divisors. In this paper, we construct classes of

m a t h i t g c d

-graphs having periodicity and perfect state transfer.

Recommendations

Cites Work

Cited In (10)

This page was built for publication: A class of \textit{gcd}-graphs having perfect state transfer