# grinpy.invariants.domination.min_total_dominating_set¶

grinpy.invariants.domination.min_total_dominating_set(G)

Return a smallest total dominating set in the graph.

The method to compute the set is brute force except that the subsets searched begin with those whose cardinality is equal to the sub-total-domination number of the graph, which was defined by Davila and shown to be a tractable lower bound for the k-domination number.

Parameters: G (NetworkX graph) – An undirected graph. A list of nodes in a smallest total dominating set in the graph. list

References

R. Davila, A note on sub-total domination in graphs. arXiv preprint arXiv:1701.07811, (2017)