This documents the development version of NetworkX. Documentation for the current release can be found here.
Finds a dominating set for the graph G.
A dominating set for a graph with node set V is a subset D of V such that every node not in D is adjacent to at least one member of D .
- GNetworkX graph
- start_withnode (default=None)
Node to use as a starting point for the algorithm.
A dominating set for G.
This function is an implementation of algorithm 7 in  which finds some dominating set, not necessarily the smallest one.
Abdol-Hossein Esfahanian. Connectivity Algorithms. http://www.cse.msu.edu/~cse835/Papers/Graph_connectivity_revised.pdf