# grinpy.invariants.domination.total_domination_number¶

grinpy.invariants.domination.total_domination_number(G)

Return the total domination number the graph.

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

The method to compute this number is modified brute force.

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