On integer domination in graphs and Vizing-like problems
From MaRDI portal
Recommendations
Cited in
(17)- Fractional dominating parameters
- 3-tuple total domination number of Rook's graphs
- From Italian domination in lexicographic product graphs to \(w\)-domination in graphs
- An integer programming approach for solving a generalized version of the Grundy domination number
- Real and integer domination in graphs
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
- On a Vizing-type integer domination conjecture
- Variations of \(Y\)-dominating functions on graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- Some results on Vizing's conjecture and related problems
- Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph
- On the \(\{k\}\)-domination number of Cartesian products of graphs
- On the total \(\{k\}\)-domination number of Cartesian products of graphs
- Rainbow domination and related problems on strongly chordal graphs
- The integer \(\{k\}\)-domination number of circulant graphs
- Cartesian product graphs and \(k\)-tuple total domination
- Integer domination of Cartesian product 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)
