Terminal Wiener Index of Balanced Trees
Sulphikar A

1Sulphikar A Department of Computer Science and Engineering National Institute of Technology Trichy Tamilnadu India.
Manuscript received on 8 August 2019. | Revised Manuscript received on 16 August 2019. | Manuscript published on 30 September 2019. | PP: 2270-2274| Volume-8 Issue-3 September 2019 | Retrieval Number: B3678078219/19©BEIESP | DOI: 10.35940/ijrte.B3678.098319
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© 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: For A Tree T, The Terminal Wiener Index TW(T) Is Defined As Half The Sum Of All Distances Of The Form D(U, V), Where The Summation Is Over All Possible Pairs Of Pendent Vertices U,V In T . We Consider A Class Of Balanced Binary Trees Called 1-Trees And Compute Their Terminal Wiener Index Values. We Also Determine 1-Trees With Minimum And Maximum Terminal Wiener Index. Keyword- Sbalanced Binary Trees, Distance In Graphs, Pendant Vertex, Terminal Wiener Index.
Scope of the Article:
Bio-Science and Bio-Technology