Some computational aspects of terminal Wiener index
by K. Viswanathan Iyer; A. Sulphikar
International Journal of Computing Science and Mathematics (IJCSM), Vol. 19, No. 2, 2024

Abstract: The terminal Wiener index of a tree T is defined as the sum of the distance between all pairs of pendent vertices in T. The concept of terminal Wiener index is used in mathematics as well as in chemistry. Several papers address the question: "What positive integers can be terminal Wiener indices of trees of a certain type?". The question has already been answered for certain types of trees. In this paper, we consider full binary trees and binomial trees. Since both of these trees can be defined recursively, we introduce a common method to derive expressions for the terminal Wiener index. Algorithms are already available to compute Wiener index of a tree in linear time. We show that if the Wiener index of a tree can be computed in linear time then its terminal Wiener index can also be computed in linear time. We also describe a linear time algorithm to compute terminal Wiener index of a tree.

Online publication date: Fri, 08-Mar-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com