Abstract
We consider the invariant W(G) of a simple connected undirected graph G which is equal to the sum of distances between all pairs of its vertices in the natural metric (the Wiener index). We show that, for every g ≥ 5, there is a planar graph G of girth g satisfying W(L(G)) = W(G), where L(G) is the line graph of G.
Sign-in/Register to access full text options 
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.
