State transfer on Cayley Graphs with their Applications in Psychology
State transfer on Cayley Graphs with their Applications in Psychology
Mohammadesmail Nikfar1
1) Associate Professor, Ph.D. in Mathematics, Department of Mathematics, School of Hekmat 1, District 4, Tehran, Iran.
IOI Code
:
ADBB-ACAFAG
Publication :
(https://www.pejournal.ir/fa/downloadpaper.php?pid=727&rid=48%20&p=A)
Abstract :
Let $X$ be a connected graph, and assume that a perfect state transfer from $u$ to $v$ occurs at time $t$. Let $S$ denote the set of eigenvalues associated with the vertex $u$. The validity of certain conditions regarding the eigenvalues in $S$ implies the truth of the expression... . Otherwise... . Consequently, the dimension of the subspace of type $\alpha$ generated by... is maximized. The preceding discussion concerns an upper bound on the maximum distance of vertices in $X$ from $u$. If... holds, then the number of vertices at a distance $s$ from $u$ is at most... . Thus, the result follows.
Keywords : regular graph perfect state transfer continuous time quantum walk