Pretty good state transfer on circulant graphs

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

circulant graph Kronecker approximation theorem pretty good state transfer

Distance in graphs (05C12) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: Let

G

be a graph with adjacency matrix

A

. The transition matrix of

G

relative to

A

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 admit pretty good state transfer between a pair of vertices

u

and

v

if there exists a sequence of real numbers

t_{k}

and a complex number

g a m m a

of unit modulus such that

l i m l i m i t s_{k i g h t a r r o w i n f t y} H (t_{k}) e_{u} = g a m m a e_{v} .

We find that pretty good state transfer occurs in a cycle on

n

vertices if and only if

n

is a power of two and it occurs between every pair of antipodal vertices. In addition, we look for pretty good state transfer in more general circulant graphs. We prove that union (edge disjoint) of an integral circulant graph with a cycle, each on

2^{k}

(k g e q 3)

vertices, admits pretty good state transfer. The complement of such union also admits pretty good state transfer. This enables us to find some non-circulant graphs admitting pretty good state transfer. Among the complement of cycles we also find a class of graphs not exhibiting pretty good state transfer.

Review text

Summary: Let \(G\) be a graph with adjacency matrix \(A\). The transition matrix of \(G\) relative to \(A\) is defined by \(H(t):=\exp(-itA)\), where \(t\in\mathbb R\). The graph \(G\) is said to admit pretty good state transfer between a pair of vertices \(u\) and \(v\) if there exists a sequence of real numbers \(\{t_k\}\) and a complex number \(\gamma\) of unit modulus such that \(\lim_{k\to\infty} H(t_k)e_u=\gamma e_v.\) We find that the cycle \(C_n\) as well as its complement \(\overline{C}_n\) admit pretty good state transfer if and only if \(n\) is a power of two, and it occurs between every pair of antipodal vertices. In addition, we look for pretty good state transfer in more general circulant graphs. We prove that union (edge disjoint) of an integral circulant graph with a cycle, each on \(2^k\) \((k\geq 3)\) vertices, admits pretty good state transfer. The complement of such union also admits pretty good state transfer. Using Cartesian products, we find some non-circulant graphs admitting pretty good state transfer.

Recommendations

Cites work

Cited in

(28)

This page was built for publication: Pretty good state transfer on circulant graphs

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