scientific article; zbMATH DE number 1444486

From MaRDI portal
Publication:4953552





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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953552)