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 : ADCA-ACAFZB
Publication : 13th International Congress of Interdisciplinary Research in Islamic Humanities, Jurisprudence, Law and Psychology(humanitycong.ir/13th)
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 the conditions regarding the eigenvalues ​​in $S$ implies the inequality $|S| \geq k^2 + 1$. Otherwise, $|S| > 2(k^2 + 1)$. Consequently, the dimension of the subspace of type A for $R(\cdot)$—generated by the vertex $u$—is at most $2(k^2 + 1)$. The preceding discussion concerns an upper bound on the maximum distance of vertices in $X$ from the vertex $u$. If $s \geq 1$, then the number of vertices at a distance $s$ from $u$ is at most $345k(1-k)$. Thus, the result holds.

Keywords : regular graph perfect state transfer continuous time quantum walk