State Transfer on Graphs And Joins

Mohammadesmail Nikfar1

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

IOI Code : ADAH-ACAFAD
Publication : The 2nd International Conference on Information Technology, Management and Computer, Babol.(confit.ir/2nd)
Abstract :
    A circulant graph is a Cayley graph defined over the cyclic group Z". As is well known, perfect state transfer cannot occur when nnn is odd. However, if n=2tn = 2tn=2t, perfect state transfer is possible only between the vertices aaa and a+ta+ta+t. Furthermore, a circulant graph is integral if and only if all of its eigenvalues are integers. Consequently, it is necessary to determine the conditions under which this property holds. The eigenvalues of a circulant graph are straightforward to compute because its eigenvectors are already known. Let 𝜁 be a primitive nnn-th root of unity in C. For an integer sss, the mapping that sends each x∈ Z" to 𝜁%& is an eigenvector. If the connection set is denoted by C, then the corresponding eigenvalue is &∈) 𝜁%&. A remarkable fact is that characterizing the connection set C, under the condition that the graph possesses only integral eigenvalues, is relatively straightforward.

Keywords : regular graph perfect state transfer continuous time quantum walk