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 the connected domination number of the graph.
Every minimum connected dominating set is a minimal connected dominating set, but the converse does not necessarily hold.
