A. Brandstädt

A study on the weighted efficient domination problem for \(C_4\)-free bipartite graphs

<p>A vertex set <span class="math inline">\(D\)</span> in a finite undirected graph <span class="math inline">\(G\)</span> is an <span><em>efficient dominating set</em></span> (<em>e.d.s.</em> for short) of <span class="math inline">\(G\)</span> if every vertex of <span class="math inline">\(G\)</span> is dominated by...