The complexity of total edge domination and some related results on trees

Zhuo Pan, Yu Yang, Xianyue Li +1

For a graph $G=(V,E)$ with vertex set $V$ and edge set $E$, a subset $F$ of $E$ is called an $\text{edge dominating set}$ (resp. a $\text{total edge dominating set}$) if every e…