SPLICES, LINKS, an‎d THEIR EDGE-DEGREE DISTANCES

The edge-degree distance of a simple connected graph G is dened as the sum of the terms ( d(e jG)+d(f jG) ) d(e; f jG) over all unordered pairs fe; fg of edges of G, where d(e jG) and d(e; f jG) 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.