# networkx.algorithms.dominating.is_dominating_set¶

is_dominating_set(G, nbunch)[source]

Checks if nbunch is a dominating set for 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.

Parameters
• G (NetworkX graph)

• nbunch (iterable) – An iterable of nodes in the graph G.

References

1

https://en.wikipedia.org/wiki/Dominating_set