Abstract
The Wiener number W( G) of a graph G is the sum of distances between all pairs of vertices of G. If ( G, w) is a vertex-weighted graph, then the Wiener number W( G, w) of ( G, w) is the sum, over all pairs of vertices, of products of weights of the vertices and their distance. For G being a partial binary Hamming graph, a formula is given for computing W( G, w) in terms of a binary Hamming labeling of G. This result is applied to prove that W(PH) = W( H ̃ S) + 36W(ID) , where PH is a phenylene, H ̃ S a pertinently vertex-weighted hexagonal squeeze of PH, and ID the inner dual of the hexagonal squeeze.
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.
