Terminal Wiener Index of Fibonacci trees
Sulphikar A

Sulphikar A*, Department of Computer Science and Engineering, National Institute of Technology, Trichy, Tamilnadu INDIA
Manuscript received on January 26, 2020. | Revised Manuscript received on February 05, 2020. | Manuscript published on February 30, 2020. | PP: 2533-2535 | Volume-9 Issue-3, February 2020. | Retrieval Number: B4542129219/2020©BEIESP | DOI: 10.35940/ijeat.B4542.029320
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: The terminal Wiener index of a tree is defined as the sum of distances between all leaf pairs of T. We derive closed form expression for the terminal Wiener index of fibonacci trees. We also describe a linear time algorithm to compute terminal Wiener index of a tree.
Keywords: Terminal Wiener index, fibonacci tree, Pendent vertex, distance in graphs.