Perfect Edge Domination: Hard and Solvable Cases

Min Chih Lin, Vadim Lozin, Veronica A. Moyano +1

Let $G$ be an undirected graph. An edge of $G$ dominates itself and all edges adjacent to it. A subset $E^{\prime }$ of edges of $G$ is an edge dominating set of $G$, if every edge of the g…