grinpy.invariants.domination.is_total_dominating_set¶
-
grinpy.invariants.domination.
is_total_dominating_set
(G, nodes)¶ Return whether or not nodes comprises 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.
Parameters: - G (NetworkX graph) – An undirected graph.
- nodes (list, set) – An iterable container of nodes in G.
Returns: True if the nodes in nbunch comprise a k-dominating set, and False otherwise.
Return type: boolean