On the number of minimum dominating sets and total dominating sets in forests
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:PIER6XCFrecord.jsonopen to challenge →
classification
math.CO
keywords
dominatinggammanumbersetsminimumdominationforestssqrt
read the original abstract
We show that the maximum number of minimum dominating sets of a forest with domination number $\gamma$ is at most $\sqrt{5}^{\gamma}$ and construct for each $\gamma$ a tree with domination number $\gamma$ that has more than $\frac{2}{5}\sqrt{5}^{\gamma}$ minimum dominating sets. Furthermore, we disprove a conjecture about the number of minimum total dominating sets in forests by Henning, Mohr and Rautenbach.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.