New Polynomial Cases of the Weighted Efficient Domination Problem

Andreas Brandstädt, Martin Milanic, Ragnar Nevries

Let G be a finite undirected graph. A vertex dominates itself and all its neighbors in G. A vertex set D is an efficient dominating set (e.d. for short) of G if every vertex of G i…