Proof of a conjecture on \(k\)-tuple domination in graphs (Q958895)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Proof of a conjecture on k-tuple domination in graphs |
scientific article; zbMATH DE number 5380069
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proof of a conjecture on \(k\)-tuple domination in graphs |
scientific article; zbMATH DE number 5380069 |
Statements
Proof of a conjecture on \(k\)-tuple domination in graphs (English)
0 references
10 December 2008
0 references
domination
0 references
\(k\)-tuple domination
0 references
probabilistic method
0 references
0.9102547764778136
0 references
0.8959894776344299
0 references
0.8931925892829895
0 references
0.8890714645385742
0 references
0.864433228969574
0 references
