University of Isfahan Transactions on Combinatorics 2251-8657 6 4 2017 12 01 Splices, Links, and their Edge-Degree Distances 29 42 21614 10.22108/toc.2017.21614 EN Mahdieh Azari Kazerun Branch, Islamic Azad University 0000-0002-0919-0598 Hojjatollah Divanpour Shiraz Technical College, Technical and Vocational University Journal Article 2017 01 28 The edge-degree distance of a simple connected graph $G$ is defined as the sum of the terms $\bigl(d(e\left|G\right.)+d(f\left|G\right.)\bigr)d(e,f\left|G\right.)$ over all unordered pairs $\{e,f\}$ of edges of $G$, where $d(e\left|G\right.)$ and $d(e,f\left|G\right.)$ 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