On the maximum number of minimum dominating sets in forests

Abstract

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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…