On the distance based indices of H-phenylenic nanotorus
Abbas Heydari
Abstract
Abbas Heydari
Abstract
Let G be a connected simple (molecular) graph. The distance d(i, j) between two vertices i and j of G is equal to the length of a shortest path that connects i and j. In this paper we compute some distance based topological indices of Hphenylenic nanotorus. At first we obtain an exact formula for the Wiener index. As an application the Schultz index and modified Schultz index of this graph will be computed by using whose Wiener index. Finally, we compute eccentric connectivity index of this graph.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let G be a connected simple (molecular) graph. The distance d(i, j) between two vertices i and j of G is equal to the length of a shortest path that connects i and j. In this paper we compute some distance based topological indices of Hphenylenic nanotorus. At first we obtain an exact formula for the Wiener index. As an application the Schultz index and modified Schultz index of this graph will be computed by using whose Wiener index. Finally, we compute eccentric connectivity index of this graph.
Key concepts: Wiener index, Topological index, Mathematics, Connectivity, Distance, Combinatorics, Graph, Resistance distance