Graphs with few total dominating sets

We give a lower bound for the number of total dominating sets of a graph together with a characterization of the extremal graphs, for trees as well as arbitrary connected graphs of given order. Moreover, we obtain a sharp lower bound involving both the order and the total domination number, and characterize the extremal graphs as well.