grinpy.invariants.power_domination.is_power_dominating_set

grinpy.invariants.power_domination.is_power_dominating_set(G, nodes)

Return whether or not the nodes in nodes comprise a power dominating set.

Parameters:

• G (NetworkX graph) – An undirected graph.
• nodes (list, set) – An iterable container of nodes in G.

Returns:

True if the nodes in nodes comprise a power dominating set, False otherwise.

Return type:

boolean