grinpy.invariants.domination.k_domination_number¶
-
grinpy.invariants.domination.k_domination_number(G, k)¶ Return the k-domination number the graph.
The k-domination number of a graph is the cardinality of a smallest k-dominating set of nodes in the graph.
The method to compute this number is modified brute force.
- G : graph
- A Networkx graph.
- kDominationNumber : int
- The k-domination number of the graph.
min_k_dominating_set, domination_number