Wiener Index of Hypertree
Binary trees are enormously used in data structure as they can be easily stored, manipulated, and retrieved. The most straightforward and extensive applications of binary trees are in the study of computer searching and sorting methods, binary identification problems, and variable binary codes. Many complex networks are easily classified and analyzed by the usage of binary tree representations. A binary tree is defined as a tree in which there is exactly one vertex of degree two and each of the remaining vertices is of degree one or three. Every binary tree is a rooted tree with odd number of vertices. A special type of binary tree known as hypertree is an interconnection topology which combines the easy expansibility of tree structures with the compactness of the hypercube. In this paper we find the Wiener index of hypertree.
- 3.Luiu, B., Nikoli, S., Trinajsti, N.: Distance-Related Molecular Descriptors. Internet Electronic Journal of Molecular Design. 7, 195–206 (2008).Google Scholar
- 6.Gutman, I., Yeh, Y. N., Lee, S. L., Luo,Y. L.: Some recent results in the theory of the Wiener number. Indian J. Chem. 32A, 651–661 (1993).Google Scholar
- 10.Randi, M.: On generalization of Wiener index for cyclic structures. Acta Chim. Slov. 49, 483–496 (2002).Google Scholar
- 19.Papa, D. A., Markov, I. L.: Hypergraph Partitioning and Clustering: In Approximation Algorithms and Metaheuristics. CRC Press, (2007).Google Scholar