State Transfer in Cayley Graphs and Strongly Regular Graphs
State Transfer in Cayley Graphs and Strongly Regular Graphs
Mohammadesmail Nikfar1
1) Associate Professor, Ph.D. in Mathematics, Department of Mathematics, School of Hekmat 1, District 4, Tehran, Iran.
IOI Code
:
ADCE-ACAEKG
Publication :
The 10th International Conference on Physics, Mathematics and Development of Basic Science(https://fmc.bcnf.ir/10th)
Abstract :
The primary tool employed in this article is spectral decomposition applied to symmetric matrices. Let $A$ be a symmetric matrix with distinct eigenvalues $\lambda_1, \dots, \lambda_m$. Let $E_r$ denote the orthogonal projection onto the corresponding eigenspace; thus, $E_r^2 = E_r$. If $f$ is a complex-valued function defined on the eigenvalues of $A$, then $f(A)$ is well-defined. Specifically, considering the function $f(\lambda) = e^{i\lambda t}$, we obtain the operator $e^{iAt}$. A significant implication of this formulation is that, for any $t$, the matrix $e^{iAt}$ is a polynomial in $A$; consequently, it commutes with $A$—and indeed with any matrix that commutes with $A$—forming an abelian family. Furthermore, we have $e^{iAt} E_r = e^{i\lambda_r t} E_r$, where the non-zero vectors in the range of $E_r$ are eigenvectors of both $A$ and $e^{iAt}$. The set of eigenvalues $\{\lambda_1, \dots, \lambda_m\}$ constitutes the spectrum of $A$.
Keywords : regular graph permutation complete quantum walk continuous chemical and molecular graph