The domination number of the graph defined by two levels of the \(n\)-cube (Q2026316)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7349642
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The domination number of the graph defined by two levels of the \(n\)-cube |
scientific article; zbMATH DE number 7349642 |
Statements
The domination number of the graph defined by two levels of the \(n\)-cube (English)
0 references
19 May 2021
0 references
domination number
0 references
Turán theorem
0 references
transversal design
0 references
0.9656137228012084
0 references
0.8562119007110596
0 references
