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.
- G : graph
- A Networkx graph.
- minPowerDominatingSet : list
- A smallest power dominating set in G.