arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.03598math.CO
收藏

循环图上的良好状态转移

Pretty Good State Transfer on Circulant Graphs

Hiranmoy Pal, Bikash Bhattacharjya

摘要:

设$G$是具有邻接矩阵$A$的图。$G$相对于$A$的转移矩阵由$H(t):=\exp{\left(-itA\right)},\;t\in\Rl$定义。图$G$被称为允许在一对顶点$u$和$v$之间有很好的状态转移,如果存在一个实数序列$\{t_k\}$和一个单位模的复数$γ$使得$\lim\limits_{k\rightarrow\infty} H(t_k) e_u=γe_v.$我们发现在$n$顶点上的一个循环中有很好的状态转移当且仅当$n$是2的幂并且它发生在每对顶点之间。此外,我们期待在更一般的循环图相当好的状态转移。我们证明,工会(边不相交)的积分循环图的循环,每个$2^k$ $(k\geq 3)$顶点,承认相当不错的状态转移。这种联盟的补充也承认相当好的状态转移。这使我们能够找到一些非循环图承认相当好的状态转移。在圈的补数中,我们还发现了一类不具有良好状态转移的图。

英文摘要:

Let $G$ be a graph with adjacency matrix $A$. The transition matrix of $G$ relative to $A$ is defined by $H(t):=\exp{\left(-itA\right)},\;t\in\Rl$. The graph $G$ is said to admit pretty good state transfer between a pair of vertices $u$ and $v$ if there exists a sequence of real numbers $\{t_k\}$ and a complex number $γ$ of unit modulus such that $\lim\limits_{k\rightarrow\infty} H(t_k) e_u=γe_v.$ We find that pretty good state transfer occurs in a cycle on $n$ vertices if and only if $n$ is a power of two and it occurs between every pair of antipodal vertices. In addition, we look for pretty good state transfer in more general circulant graphs. We prove that union (edge disjoint) of an integral circulant graph with a cycle, each on $2^k$ $(k\geq 3)$ vertices, admits pretty good state transfer. The complement of such union also admits pretty good state transfer. This enables us to find some non-circulant graphs admitting pretty good state transfer. Among the complement of cycles we also find a class of graphs not exhibiting pretty good state transfer.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑