Given a connected graph with domination (or total domination) number gamma >= 2, we ask for the maximum number m(gamma) and m(T,gamma) of dominating and total dominating sets of size gamma. An exact answer is provided for gamma = 2 and lower bounds are given for m(gamma), m(T,gamma); gamma >= 3.