On integer domination in graphs and Vizing-like problems
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.
- On the \(\{k\}\)-domination number of Cartesian products of graphs
- On the total \(\{k\}\)-domination number of Cartesian products of graphs
- Real and integer domination in graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- An integer programming approach for solving a generalized version of the Grundy domination number
- 3-tuple total domination number of Rook's graphs
- Integer domination of Cartesian product graphs
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
- Rainbow domination and related problems on strongly chordal graphs
- Fractional dominating parameters
- Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph
- From Italian domination in lexicographic product graphs to \(w\)-domination in graphs
- Cartesian product graphs and \(k\)-tuple total domination
- On a Vizing-type integer domination conjecture
- The integer \(\{k\}\)-domination number of circulant graphs
- The \(\{2\}\)-domination in rooted product graphs
- Some results on Vizing's conjecture and related problems
- On the {2}-domination number of rooted product graphs
- Variations of \(Y\)-dominating functions on graphs
This page was built for publication: On integer domination in graphs and Vizing-like problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861441)
