The total domination polynomial of a graph
counts its total dominating
sets by size (Latheeshkumar and Anil Kumar 2017). If
counts the total dominating
sets of size
,
then
When
is nonzero, its least exponent is the total
domination number of
.
A graph with an isolated
vertex has
.
For the complete graph with
,
every subset of at least two vertices
is a total dominating set, so