Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs

Andreas Brandstädt, Arne Leitert, Dieter Rautenbach

Let G=(V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v in V dominates its closed neighborhood N[v]. A vertex set D in G is an efficient domin…