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

13 Oct 2019 Pan Zhuo Yang Yu Li Xianyue Xu Shou-Jun

For a graph $G = (V, E)$ with vertex set $V$ and edge set $E$, a subset $F$ of $E$ is called an $\emph{edge dominating set}$ (resp. a $\emph{total edge dominating set}$) if every edge in $E\backslash F$ (resp... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS