Abstract
We provide an algorithm for listing all minimal double dominating sets of a tree of order n in time $\mathcal{O}$(1.3248n). This implies that every tree has at most 1.3248n minimal double dominating sets. We also show that this bound is tight.
Keywords
Get full access to this article
View all access options for this article.