An Algorithm for Listing all Minimal Double Dominating Sets of a Tree

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