Name
Abstract | ||
|---|---|---|
Fricke, Hedetniemi, Hedetniemi, and Hutson asked whether every tree with domination number γ has at most 2γ minimum dominating sets. Bień gave a counterexample, which allows us 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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.disc.2018.11.025 | Discrete Mathematics |
Keywords | Field | DocType |
Tree,Domination number,Minimum dominating set,Independence number,Maximum independent set | Discrete mathematics,Combinatorics,Independence number,Counterexample,Domination analysis,Mathematics | Journal |
Volume | Issue | ISSN |
342 | 4 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| José D. Alvarado | 1 | 7 | 3.82 |
| Simone Dantas | 2 | 119 | 24.99 |
| E. Mohr | 3 | 0 | 2.03 |
| Dieter Rautenbach | 4 | 946 | 138.87 |