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.
Returns:The total domination number of the graph.
Return type:int