# grinpy.invariants.power_domination.min_power_dominating_set¶

grinpy.invariants.power_domination.min_power_dominating_set(G)

Return a smallest power dominating set of nodes in G.

The method used to compute the set is brute force.

Parameters: G (NetworkX graph) – An undirected graph. A list of nodes in a smallest power dominating set in G. list