Abstract
Distance properties of molecular graphs form an important topic in chemical graph theory. The Wiener index of a graph G is defined as the sum of all distances between distinct vertices of G. A lot of research has been devoted to finding Wiener index by brute force method. In this paper we develop a method to compute the Wiener index of certain chemical graphs without using distance matrix.
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 Computational and Theoretical Nanoscience
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.
