On computation of some distance-based topological indices of circulant networks

Abstract

The distance, $d(u,v)$, between two vertices $u$ and $v$ of a connected graph $G$ is the length of a $u-v$ geodesic in $G$. A large number of graph-distance-based topological indices in various families of graphs and networks have been computed. In this paper, we consider circulant networks and compute three distance-based topological indices, namely the Wiener index, hyper-Wiener index and Schultz molecular topological index on these networks.