Maximum Number of Minimum Dominating and Minimum Total Dominating Sets
Abstract
Given a connected graph with domination (or total domination) number γ>=2, we ask for the maximum number mγ and mγ,T of dominating and total dominating sets of size γ. An exact answer is provided for γ=2and lower bounds are given for γ>=3.
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.