"Bounds on the Maximum Number of Minimum Dominating Sets" by Samuel Connolly, Zachary Gabor et al.
 

Bounds on the Maximum Number of Minimum Dominating Sets

Document Type

Article

Publication Date

5-6-2016

Description

Given a graph with domination number γ, we find bounds on the maximum number of minimum dominating sets. First, for γ≥3, we obtain lower bounds on the number of γ-sets that do not dominate a graph on n vertices. Then, we show that γ-fold lexicographic product of the complete graph on n1/γ vertices has domination number γ and γn-O(nγ-γ/1) dominating sets of size γ. Finally, we see that a certain random graph has, with high probability, (i) domination number γ; and (ii) all but o(nγ) of its γ-sets being dominating.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 12
  • Usage
    • Abstract Views: 2
  • Captures
    • Readers: 3
see details

Share

COinS