Abstract
Binary and [Formula: see text]-ary trees have extensive applications, particularly in computer science and chemistry. We present exact values of all important distance-based indices for complete [Formula: see text]-ary trees. We solve recurrence relations to obtain the value of the most well-known index called the Wiener index. New methods are used to express the other indices (the degree distance, the eccentric distance sum, the Gutman index, the edge-Wiener index, the hyper-Wiener index and the edge-hyper-Wiener index) as well. Values of distance-based indices for complete binary trees are corollaries of the main results.
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.
