University of IsfahanTransactions on Combinatorics2251-86576420171201Splices, Links, and their Edge-Degree Distances29422161410.22108/toc.2017.21614ENMahdiehAzariKazerun Branch, Islamic Azad UniversityHojjatollahDivanpourShiraz Technical College, Technical and Vocational UniversityJournal Article20170128The edge-degree distance of a simple connected graph G is defined as the sum of the terms<br /> (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<br /> 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.https://toc.ui.ac.ir/article_21614_033f4714ff9a47c358a450a46e9a3122.pdf