Abstract

Hypertree of dimension $t$ is a complete binary tree, where two vertices with a label difference of $2^{i-2},\,1\le i\le t$, along the same level, are connected by a horizontal edge called, hyperedge. We have determined the distance based topological indices of Hypertree. Topological indices are the parameters to describe the physicochemical properties of chemical graphs. We have computed the analytical expressions for the distance based indices for Hypertree. Also, we have done a comparative study between Hypertree and complete binary tree.

Keywords and Phrases

Message traffic density, Szeged index, Mostar index, network throughput.

A.M.S. subject classification

05C05, 05C12, 05C65, 05C92.

.....