Management Applications of Perfect State Transfer in graphs
Management Applications of Perfect State Transfer in graphs
Mohammadesmail Nikfar1
1) Associate Professor, Ph.D. in Mathematics, Department of Mathematics, School of Hekmat 1, District 4, Tehran, Iran.
IOI Code
:
ADBA-ACAFAH
Publication :
(https://www.omjournal.ir/fa/downloadpaper.php?pid=633&rid=53&p=A)
Abstract :
It has been established that perfect state transfer between the endpoints of a path graph on $n$ vertices cannot occur if a certain condition holds. Furthermore, it can be shown that only specific paths allow for perfect state transfer. This approach was developed as part of a collaborative project. To begin, we recall some fundamental properties of path graphs. First, the characteristic polynomial satisfies a specific recurrence relation. A consequence of this is that certain terms are coprime. Since interpolation implies that any multiple of an eigenvalue must also be an eigenvalue, it follows that the eigenvalues of a path graph are simple. Now, assume that two specific parameters are coprime. Then, under this framework, perfect state transfer between the endpoints of the path cannot occur, provided a certain condition is met. By utilizing a specific identity—which can be easily derived via induction for the aforementioned recurrence relation—it can be shown that two terms share a non-trivial common factor if and only if $m+1$ divides $n+1$. This result provides a broader range of possibilities for the occurrence of perfect state transfer.
Keywords : regular graph perfect state transfer continuous time quantum walk