%0 Journal Article
%T Splices, Links, and their Edge-Degree Distances
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A Azari, Mahdieh
%A Divanpour, Hojjatollah
%D 2017
%\ 12/01/2017
%V 6
%N 4
%P 29-42
%! Splices, Links, and their Edge-Degree Distances
%K Distance
%K degree
%K edge-degree distance
%K splice of graphs
%K link of graphs
%R 10.22108/toc.2017.21614
%X The edge-degree distance of a simple connected graph $G$ is defined as the sum of the terms $bigl(d(eleft|Gright.)+d(fleft|Gright.)bigr)d(e,fleft|Gright.)$ over all unordered pairs ${e,f}$ of edges of $G$, where $d(eleft|Gright.)$ and $d(e,fleft|Gright.)$ 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.
%U https://toc.ui.ac.ir/article_21614_033f4714ff9a47c358a450a46e9a3122.pdf