On the sum of all distances in composite graphs Original Research Article

Let G1 × G2, G1 + G2, G1[G2], G1 o G2 and G1{G2} be the product, join, composition, corona and cluster, respectively, of the graphs G1 and G2. We compute the sum of distances between all pairs of vertices in these composite graphs.