The upper bound on \(k\)-tuple domination numbers of graphs (Q925036)
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: The upper bound on k-tuple domination numbers of graphs |
scientific article; zbMATH DE number 5280771
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The upper bound on \(k\)-tuple domination numbers of graphs |
scientific article; zbMATH DE number 5280771 |
Statements
The upper bound on \(k\)-tuple domination numbers of graphs (English)
0 references
29 May 2008
0 references
\(k\)-tuple domination number
0 references
upper bound
0 references
0.946001410484314
0 references
0.9371618628501892
0 references
0.9359227418899536
0 references
0.9308307766914368
0 references
0.9196380376815796
0 references
