Terminal wiener index of balanced trees

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.