arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1104.1097math.CO
收藏

整循环图的距离谱和距离能量

Distance spectra and Distance energy of Integral Circulant Graphs

Aleksandar Ili\' c

摘要:

图$G$的距离能量是最近发展起来的能量型不变量,定义为图$G$的距离矩阵的特征值的绝对值之和.对于具有等距离能量的非共谱图对和非共谱图族的研究有着广泛的研究,这些研究大多是基于图的并。如果一个图是循环群上的Cayley图,即它的邻接矩阵是循环的,则称它是循环图。如果一个图的邻接矩阵的所有特征值都是整数,则称该图为整图。积分循环图在模拟量子自旋网络中起着重要的作用。本文刻画了整循环图的距离谱,证明了这类图具有距离矩阵$D$的整特征值。此外,我们还计算了酉Cayley图的距离谱和距离能量。最后,我们给出了两类等距能量整循环图对$(G_1, G_2)$--在第一类中,$G_1$是$G_2$的子图,而在第二类中,两个图的直径都是3.

英文摘要:

The distance energy of a graph $G$ is a recently developed energy-type invariant, defined as the sum of absolute values of the eigenvalues of the distance matrix of $G$. There was a vast research for the pairs and families of non-cospectral graphs having equal distance energy, and most of these constructions were based on the join of graphs. A graph is called circulant if it is Cayley graph on the circulant group, i.e. its adjacency matrix is circulant. A graph is called integral if all eigenvalues of its adjacency matrix are integers. Integral circulant graphs play an important role in modeling quantum spin networks supporting the perfect state transfer. In this paper, we characterize the distance spectra of integral circulant graphs and prove that these graphs have integral eigenvalues of distance matrix $D$. Furthermore, we calculate the distance spectra and distance energy of unitary Cayley graphs. In conclusion, we present two families of pairs $(G_1, G_2)$ of integral circulant graphs with equal distance energy -- in the first family $G_1$ is subgraph of $G_2$, while in the second family the diameter of both graphs is three.

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

↑