New Upper Bounds on the Minimal Domination Numbers of High-Dimensional Hypercubes
We briefly review known results on upper bounds for the minimal domination number $\gamma_n$ of a hypercube of dimension $n$, then present a new method for constructing dominating sets. Write $n =2^{\hat{n}}-1 +{\check{n}}$ with $0\leq {\check{n}}
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | We briefly review known results on upper bounds for the minimal domination
number $\gamma_n$ of a hypercube of dimension $n$, then present a new method
for constructing dominating sets.
Write $n =2^{\hat{n}}-1 +{\check{n}}$ with $0\leq {\check{n}} |
|---|---|
| DOI: | 10.48550/arxiv.2409.14621 |