






















Fricke, Hedetniemi, Hedetniemi, and Hutson asked whether every tree with domination number $γ$ has at most $2^γ$ minimum dominating sets. Bien gave a counterexample, which allows to construct forests with domination number $γ$ and $2.0598^γ$ minimum dominating sets. We show that every forest with domination number $γ$ has at most $2.4606^γ$ minimum dominating sets, and that every tree with independence number $α$ has at most $2^{α-1}+1$ maximum independent sets.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。