On the maximum number of minimum dominating sets in forests

DOI10.1016/j.disc.2018.11.025zbMath1405.05129arXiv1804.00158OpenAlexW2962941527MaRDI QIDQ1727765

Elena Mohr, Simone Dantas, Dieter Rautenbach, José D. Alvarado

Publication date: 20 February 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.00158

zbMATH Keywords

treeindependence numberdomination numbermaximum independent setminimum dominating set

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (11)

Maximal and maximum dissociation sets in general and triangle-free graphs ⋮ Minimum Dominating Set for the Prism Graph Family ⋮ The maximum number of maximum dissociation sets in trees ⋮ Maximum dissociation sets in subcubic trees ⋮ On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number ⋮ Minimum number of maximal dissociation sets in trees ⋮ On the maximum number of maximum dissociation sets in trees with given dissociation number ⋮ On the number of minimum dominating sets in trees ⋮ Unnamed Item ⋮ Trees with extremal numbers of \(k\)-dominating sets ⋮ On the maximum number of maximum independent sets

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds on the maximum number of minimum dominating sets
• The maximum number of maximal independent sets in unicyclic connected graphs
• Trees with extremal numbers of maximal independent sets including the set of leaves
• γ-graphs of graphs
• The structure and maximum number of maximum independent sets in trees
• Algorithms and Computation

This page was built for publication: On the maximum number of minimum dominating sets in forests