Abstract
The Wiener index W ( G ) of a simple connected graph G is defined as the sum of distances over all pairs of vertices in a graph. We denote by W [ T n ] the set of all values of the Wiener index for a graph from the class T n of trees on n vertices. The largest interval of consecutive integers (consecutive even integers in case of odd n ) contained in W [ T n ] is denoted by W int [ T n ]. In this paper we prove that both sets are of cardinality 1 ⁄ 6 n 3 + O ( n 5/2 ) in the case of even n , while in the case of odd n we prove that the cardinality of both sets equals 1 ⁄ 12 n 3 + O( n 5/2 ), which essentially solves two conjectures posed in the literature.
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.
