# grinpy.invariants.domination.domination_number¶

grinpy.invariants.domination.domination_number(G)

Return the domination number the graph.

The domination number of a graph is the cardinality of a smallest dominating set of nodes in the graph.

The method to compute this number modified brute force.

Parameters: G (NetworkX graph) – An undirected graph. The domination number of the graph. int