Warning

This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.

Dominating Sets

Functions for computing dominating sets in a graph.

dominating_set(G[, start_with])	Finds a dominating set for the graph G.
is_dominating_set(G, nbunch)	Checks if nbunch is a dominating set for G.