  Motivated by the question of computing the probability of successful power
domination by placing k monitors uniformly at random, in this paper we give a
recursive formula to count the number of power domination sets of size k in a
labeled complete m-ary tree. As a corollary we show that the desired
probability can be computed in exponential with linear exponent time.
