Maximum Number of Minimum Dominating and Minimum Total Dominating Sets
Combinatorics
2013-08-15 v1
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.
Cite
@article{arxiv.1308.3178,
title = {Maximum Number of Minimum Dominating and Minimum Total Dominating Sets},
author = {Anant Godbole and Jessie Jamieson and William Jamieson},
journal= {arXiv preprint arXiv:1308.3178},
year = {2013}
}
Comments
6 pages