No label defined (Q4378634)
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 1124605
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1124605 |
Statements
8 July 1998
0 references
\(k\)-domination number
0 references
distance domination
0 references
0 references
0 references
0.92085665
0 references
0 references
0 references
For \(k\geq 1\), a set \(S\) of vertices of a graph \(G=(V,E)\) is a \(k\)-dominating set of \(G\) if every vertex of \(V-S\) is within distance \(k\) from some vertex of \(S\). The smallest cardinality of a \(k\)-dominating set is called the \(k\)-domination number. The total \(k\)-domination number, the independent \(k\)-domination number and the \(k\)-irredundance number of a graph have the expected definitions. The author surveys a number of results pertaining to these four distance domination parameters. For the entire collection see [Zbl 0883.00011].
0 references