Open AccessTerminal Wiener Index of Balanced Trees
Author(s) -
A Sulphikar
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.b3678.098319
Subject(s) - wiener index , terminal (telecommunication) , index (typography) , mathematics , binary tree , combinatorics , tree (set theory) , class (philosophy) , discrete mathematics , computer science , telecommunications , graph , artificial intelligence , world wide web
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. WeConsiderAClass 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