Maximum Number of Minimum Dominating and Minimum Total Dominating Sets
classification
🧮 math.CO
keywords
gammadominatingnumbertotaldominationgivenmaximumminimum
read the original abstract
Given a connected graph with domination (or total domination) number \gamma>=2, we ask for the maximum number m_\gamma and m_{\gamma,T} of dominating and total dominating sets of size \gamma. An exact answer is provided for \gamma=2and lower bounds are given for \gamma>=3.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.