Abstract
Let G be a connected graph with vertex set V(G) = {v1, v2,..., vng} and edge set E(G).D(G) = (dij)nxn is the distance matrix of G, where dij denotes the distance between vi and vj. Let ?1(D) ? ?2(D)?... ? ?n(D) be the distance spectrum of G. A graph G is said to be determined by its distance spectrum if any graph having the same distance spectrum as G is isomorphic to G. Trees can not be determined by its distance spectrum. Naturally, we prove that two kinds of special trees path Pn and double star S(a,b) are determined by their distance spectra in this paper.
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.
