A bound on the \(k\)-domination number of a graph. (Q3073450)
From MaRDI portal
!
WARNING
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 5850439
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bound on the \(k\)-domination number of a graph. |
scientific article; zbMATH DE number 5850439 |
Statements
A bound on the k-domination number of a graph (English)
0 references
11 February 2011
0 references
domination
0 references
\(k\)-domination number
0 references
\(P_4\)-free graph
0 references
0.9250101447105408
0 references
0.9067867994308472
0 references
0.8873352408409119
0 references
0.8821138739585876
0 references
0.8762202262878418
0 references
