Distance Based Topological Indices of Double graphs and Strong Double graphs

Abstract

Topological index is a numerical representation of structure of graph. They are mainly classified as Distance and Degree based topological indices. In this article Distance based topological indices of Double graphs and Strong Double graphs are calculated. Let $G$ be a graph of order $n$ with the vertex set $ V(G)$ containing vertices $v_1,v_2,....,v_n$. Double graph of graph $G$ is constructed by taking two copies of G in which a vertex $v_i$ in one copy is adjacent to a vertex $v_j$ in the another copy if $ v_i$ and $v_j$ are adjacent in G. Strong Double graph is a double graph in which a vertex $v_i$ in one copy is adjacent to a vertex $v_j$ in the another copy if $i=j$.

Keywords

• topological indices
• double graphs
• strong double graphs