Abstract
The Wiener index W(G) of a connected graph G is the sum of distances between all pairs of vertices of G. A connected graph G is said to be a cactus if each of its blocks is either a cycle or an edge. Let Gn,t be the set of all n-vertex cacti containing exactly t cycles. Liu and Lu (2007) determined the unique graph in Gn,t with the minimum Wiener index. We now establish a sharp upper bound on the Wiener index of graphs in Gn,t and identify the corresponding extremal graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.