arXiv Analytics

Sign in

arXiv:1804.00158 [math.CO]AbstractReferencesReviewsResources

On the maximum number of minimum dominating sets in forests

J. D. Alvarado, S. Dantas, E. Mohr, D. Rautenbach

Published 2018-03-31, updated 2018-04-11Version 2

Fricke, Hedetniemi, Hedetniemi, and Hutson asked whether every tree with domination number $\gamma$ has at most $2^\gamma$ minimum dominating sets. Bien gave a counterexample, which allows to construct forests with domination number $\gamma$ and $2.0598^\gamma$ minimum dominating sets. We show that every forest with domination number $\gamma$ has at most $2.4606^\gamma$ minimum dominating sets, and that every tree with independence number $\alpha$ has at most $2^{\alpha-1}+1$ maximum independent sets.

Related articles: Most relevant | Search more
arXiv:1308.3210 [math.CO] (Published 2013-08-14)
Bounds on the Maximum Number of Minimum Dominating Sets
arXiv:1209.3115 [math.CO] (Published 2012-09-14, updated 2015-03-15)
On the Concentration of the Domination Number of the Random Graph
arXiv:1309.1632 [math.CO] (Published 2013-09-06, updated 2014-01-10)
The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number