Abstract
The Wiener index is one of the main descriptors that correlate a chemical compound’s molecular graph with experimentally gathered data regarding the compound’s characteristics. A long standing conjecture on the Wiener index ([4, 5]) states that for any positive integer \(n\) (except numbers from a given 49 element set), one can find a tree with Wiener index \(n\). In this paper, we prove that every integer \(n>10^8\) is the Wiener index of some short caterpillar tree with at most six non-leaf vertices. The Wiener index conjecture for trees then follows from this and the computational results in [8] and [5].
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.