Upper bounds on the signed edge domination number of a graph

Fengming Dong, Jun Ge, Yan Yang

A signed edge domination function (or SEDF) of a simple graph $G=(V,E)$ is a function $f:E\to \{1,-1\}$ such that ${\sum }_{e^{\prime }\in N[e]}f(e^{\prime })\ge 1$ holds for each edge $e\in E…