Minimum edge dominating sets

A $$k$$k-connected (resp. $$k$$k-edge connected) dominating set $$D$$D of a connected graph $$G$$G is a subset of $$V(G)$$V(G) such that $$G[D]$$G[D] is $$k$$k-connected (resp. $$k$$k-edge connected) and each $$v\in V(G)\backslash D$$v V(G)\D has at ...

We prove that the problem of finding two minimum dominating sets (connected dominating sets or clique transversals) with minimum intersection is polynomially solvable on interval graphs. Furthermore, the problem of deciding whether or not there exist ...

A set D V ( G ) of a graph G is a dominating set if every vertex v V ( G ) is either in D or adjacent to a vertex in D . The domination number γ ( G ) of a graph G is the minimum cardinality of a dominating set of G . Campos and Wakabayashi (2013) and ...