On integer domination in graphs and Vizing-like problems (Q861441)

Let \(V(G)\) be the vertex set of a graph \(G\), and let \(k\geq 1\) be an integer. A function \(f:V(G)\rightarrow\{0,1,\dots,k\}\) is called a \(\{k\}\)-dominating function if for every vertex, the sum of the function values over its closed neighborhood is at least \(k\). The weight of a \(\{k\}\)-dominating function is the sum of its function values over all vertices. The \(\{k\}\)-domination number of a graph \(G\) is the minimum weight of a \(\{k\}\)-dominating function of \(G\). The authors study the \(\{k\}\)-domination number of the Cartesian product of graphs, mostly on problems related to Vizing's unsolved conjecture. Connections between the \(\{k\}\)-domination number and the classical domination number and the \(k\)-tuple domination number are also presented.