Some Graphs Determined By Their Distance Spectrum
Some Graphs Determined By Their Distance Spectrum
复制标题
DOI：
10.13001/1081-3810.3613
复制
发表时间：
2018-02
影响因子：
0.7
通讯作者：
S. Drury;Huiqiu Lin
中科院分区：
文献类型：
--
作者：
S. Drury;Huiqiu Lin
设$G$为顺序为$n$的连通图。设$\lambda_1(D(G))\geq \cdots\geq \lambda_n(D(G))$为$G$的距离谱。本文证明了$P_n$和$C_n$的补是由它们的$D$ -谱决定的。此外，还表明周期$C_n$ （$n$奇数）也由其$D$ -谱决定。
Let $G$ be a connected graph with order $n$. Let $\lambda_1(D(G))\geq \cdots\geq \lambda_n(D(G))$ be the distance spectrum of $G$. In this paper, it is shown that the complements of $P_n$ and $C_n$ are determined by their $D$-spectrum. Moreover, it is shown that the cycle $C_n$ ($n$ odd) is also determined by its $D$-spectrum.