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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
