
Summary: Let \(G\) be a connected graph, and let \(D[G]\) denote the double graph of \(G\). In this paper, we first derive closed-form formulas for different distance based topological indices for \(D[G]\) in terms of that of \(G\). Finally, as illustrative examples, these formulas are applied to several special kinds of graphs, such as, the complete graph, the path, and the cycle.
Wiener index, Applications of graph theory, Molecular structure (graph-theoretic methods, methods of differential topology, etc.), Harary index, double graph
Wiener index, Applications of graph theory, Molecular structure (graph-theoretic methods, methods of differential topology, etc.), Harary index, double graph
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
