No label defined (Q4953552)
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 1444486
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1444486 |
Statements
9 May 2000
0 references
domination
0 references
domatic number
0 references
\(k\)-tuple domination
0 references
double domination
0 references
\(k\)-tuple domatic number
0 references
dominating set
0 references
dominating number
0 references
domatic partition
0 references
0.9465166330337524
0 references
0.9228109121322632
0 references
0.902670919895172
0 references
0.9005813598632812
0 references
0.8963743448257446
0 references
A node \(v\) in a graph \(G=(V,E)\) is said to dominate itself and all nodes in its closed neighborhood \(N(v)\). A set \(S\subseteq V\) is a \(k\)-tuple dominating set if each node in \(V\) is dominated by at least \(k\) nodes in \(S\). The order of a smallest \(k\)-tuple dominating set is the \(k\)-tuple domination number, written \(\gamma _k(G)\). A \(k\)-tuple domatic partition is a partition of \(V\) into \(k\)-tuple dominating sets. Then the \(k\)-tuple domatic number \(d_k(G)\) is defined as the largest number of sets in a \(k\)-tuple domatic partition. Notice that \(\gamma _1\) is the well-known domination number, and \(d_1\) is the domatic number, respectively. In the paper various upper bounds for \(d_k\) involving the minimum degree \(\delta \) are derived. These bounds extend and/or improve known bounds for \(d_1\) by \textit{E. J. Cockayne} and \textit{S. T. Hedetniemi} [Networks 7, 247-261 (1977; Zbl 0384.05051)]. Moreover, three open problems concerning \(d_k\) are stated.
0 references