networkx 2.8.2 Pypi GitHub Homepage
Other Docs
ParametersBackRef
is_dominating_set(G, nbunch)

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 .

Parameters

G : NetworkX graph
nbunch : iterable

An iterable of nodes in the graph G.

Checks if nbunch is a dominating set for G.

See Also

dominating_set

Examples

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.algorithms.dominating.dominating_set

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them


GitHub : /networkx/algorithms/dominating.py#67
type: <class 'function'>
Commit: