MINIMAL 2-DOMINATING SETS IN TREES
We provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3248(n)). This implies that every tree has at most 1.3248(n) minimal 2-dominating sets. We also show that this bound is tight.
minimal 2-dominating set 2-domination tree domination counting exact exponential algorithm listing algorithm