We show that the number of minimal dominating sets in a graph on
vertices is at most 1.7697
, thus improving on the trivial
bound. Our result makes use of the measure and conquer technique from exact algorithms, and can be easily turned into an
Based on this result, we derive an
algorithm for the domatic number problem, and an
algorithm for the minimum-weight dominating set problem. Both algorithms improve over the previous algorithms.