Splices, Links, and their Edge-Degree Distances

The edge-degree distance of a simple connected graph G is defined as the sum of the terms (d(e|G)+d(f|G))d(e,f|G) over all unordered pairs {e,f} of edges of G, where d(e|G) and d(e,f|G) denote the degree of the edge e in G and the distance between the edges e and f in G, respectively. In this paper, we study the behavior of two versions of the edge-degree distance under two graph products called splice and link.