On integer domination in graphs and Vizing-like problems

DOI10.11650/twjm/1500557305zbMath1109.05081OpenAlexW1837776052MaRDI QIDQ861441

Michael A. Henning, Sandi Klavžar, Boštjan Brešar

Publication date: 29 January 2007

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500557305

zbMATH Keywords

Cartesian product\(\{k\}\)-domination function

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

From Italian domination in lexicographic product graphs to w-domination in graphs ⋮ Cartesian product graphs and k-tuple total domination ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Rainbow domination and related problems on strongly chordal graphs ⋮ Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph ⋮ Variations of \(Y\)-dominating functions on graphs ⋮ Some results on Vizing's conjecture and related problems ⋮ Fractional Dominating Parameters ⋮ 3-tuple total domination number of Rook's graphs ⋮ On the \(\{k\}\)-domination number of Cartesian products of graphs ⋮ On the total \(\{k\}\)-domination number of Cartesian products of graphs ⋮ Integer domination of Cartesian product graphs ⋮ The integer {k}-domination number of circulant graphs ⋮ On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs

This page was built for publication: On integer domination in graphs and Vizing-like problems