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 1.
G (NetworkX graph)
start_with (node (default=None)) – Node to use as a starting point for the algorithm.
D – A dominating set for G.
- Return type
This function is an implementation of algorithm 7 in 2 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