State Transfer on Cayley Graphs in The Sense of Abelian Groups

State Transfer on Cayley Graphs in The Sense of Abelian Groups

Mohammadesmail Nikfar1

1) Associate Professor, Ph.D. in Mathematics, Department of Mathematics, School of Hekmat 1, District 4, Tehran, Iran.

IOI Code : ACGH-ACAEKD
Publication : The 1st National Conference of Expert Teachers(confn.ir/1st)
Abstract :
    A circulant graph—a type of Cayley graph—is defined over the cyclic group $\mathbb{Z}_n$. As previously noted, perfect state transfer cannot occur if $n$ is odd. However, if $n = 2t$, perfect state transfer can occur, specifically between vertices $a$ and $a+t$. Furthermore, a circulant graph is "integral" (i.e., its eigenvalues ​​are integers) if and only if certain conditions are met. Calculating the eigenvalues ​​of a circulant graph is straightforward, as its eigenvectors are known. Let $\omega$ be a primitive $n$-th root of unity in $\mathbb{C}$. For any integer $s$, the function that maps $x \in \mathbb{Z}_n$ to $\omega^{sx}$ serves as an eigenvector. If $C$ is the set of connections (the connection set), the corresponding eigenvalue is given by $\sum_{c \in C} \omega^{sc}$. Interestingly, characterizing the connection set $C$ under the condition that the graph has only integer eigenvalues ​​is a relatively simple task.

Keywords : regular graph perfect state transfer continuous time quantum walk