فهرست نشریات علمی دسترسی آزاد ایران

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.