e/Connected dominating set

Information
has gloss	eng: In graph theory, a connected dominating set of a graph G = (V, E) is a set of vertices D ⊆ V such that # D is a dominating set of G, and # the subgraph induced by D is connected.
lexicalization	eng: connected dominating set
instance of	c/Computational problems in graph theory