Warning

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

is_dominating_set

is_dominating_set(G, nbunch)[source]

Checks if nodes in nbunch are a dominating set for G.

A dominating set for a graph \(G = (V, E)\) is a node subset \(D\) of \(V\) such that every node not in \(D\) is adjacent to at least one member of \(D\) [R244].

Parameters:

G : NetworkX graph

nbunch : Node container

See also

dominating_set

References

[R244](1, 2) http://en.wikipedia.org/wiki/Dominating_set