Minimal 2-dominating sets in trees

Abstract

We provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time 𝒪(1.3248n ). This implies that every tree has at most 1.3248n minimal 2-dominating sets. We also show that this bound is tight.