Bounds on the maximum number of minimum dominating sets
From MaRDI portal
Publication:271624
DOI10.1016/j.disc.2015.12.030zbMath1333.05218arXiv1308.3210OpenAlexW1512105312MaRDI QIDQ271624
F. Blanchet-Sadri, M. Dambrine
Publication date: 7 April 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.3210
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
Counting dominating sets and related structures in graphs ⋮ Fast winning strategies for the maker-breaker domination game ⋮ Maximal and maximum dissociation sets in general and triangle-free graphs ⋮ Super domination: graph classes, products and enumeration ⋮ Maximum dissociation sets in subcubic trees ⋮ Minimum number of maximal dissociation sets in trees ⋮ On the maximum number of maximum dissociation sets in trees with given dissociation number ⋮ On the maximum number of minimum dominating sets in forests ⋮ Maker-breaker domination number
Cites Work
This page was built for publication: Bounds on the maximum number of minimum dominating sets