Weighted Efficient Domination for $(P_5+k{P}_2)$-Free Graphs in Polynomial Time

Andreas Brandstadt, Vassilis Giakoumakis

Let $G$ be a finite undirected graph. A vertex {\em dominates} itself and all its neighbors in $G$. A vertex set $D$ is an {\em efficient dominating set} (\emph{e.d.}\ for short) o…