Abstract
The Wiener index (W) and the Hosoya polynomial (H) have been calculated for all trees (and thus for all chemical trees) with 20 and fewer vertices. Corroborating an earlier observation (Razinger, M. et al. J. Chem. Inf. Comput. Sci. 1985, 25, 23−27), we show that the ability of W to distinguish between nonisomorphic n-vertex trees (respectively, chemical trees) depends on n in an alternating manner: it increases for even values of n and decreases for odd values of n. An analogous behavior is also found in the case of H.
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 callMore From: Journal of Chemical Information and Computer Sciences
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.
