Three Constructions on Graphs and Distance-Based Invariants

Many graphs are constructed from simpler ones by the use of operations on graphs, and as a consequence, the properties of the resulting constructions are strongly related to the properties of their constituents. This paper is concerned with computing some distance-based graph invariants for three constructions on graphs namely double graph, extended double cover, and strong double graph.