grinpy.invariants.domination.is_total_dominating_set¶
-
grinpy.invariants.domination.is_total_dominating_set(G, nbunch)¶ Return whether or not the nodes in nbunch comprise a total dominating set.
A * total dominating set* is a set of nodes with the property that every node in the graph is adjacent to some node in the set.
- G : graph
- A Networkx graph.
nbunch: a single node or iterable container or nodes
- isTotalDominating : bool
- True if the nodes in nbunch comprise a k-dominating set, and False otherwise.