•  
  •  
 

Keywords

Distance spectrum; Complement; Cospectral.

Abstract

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.

Share

COinS
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.