# Domination¶

Functions for computing dominating sets in a graph.

 is_k_dominating_set(G, nbunch, k) Return whether or not the nodes in nbunch comprise a k-dominating set. is_total_dominating_set(G, nbunch) Return whether or not the nodes in nbunch comprise a total dominating set. min_k_dominating_set(G, k) Return a smallest k-dominating set in the graph. min_dominating_set(G) Return a smallest dominating set in the graph. min_total_dominating_set(G) Return a smallest total dominating set in the graph. domination_number(G) Return the domination number the graph. k_domination_number(G, k) Return the k-domination number the graph. total_domination_number(G) Return the total domination number the graph.