Minimum Connected Dominating Set

Download Wolfram Notebook

A minimum connected dominating set is a connected dominating set of a graph that is of smallest possible size. In other words, it is a connected dominating set with size equal to a graph's connected domination number.

See also

Connecetd Dominating Set, Connected Domination Number

Explore with Wolfram|Alpha

More things to try:

Cite this as:

Weisstein, Eric W. "Minimum Connected Dominating Set." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/MinimumConnectedDominatingSet.html

Subject classifications