On the \k\-domination number of Cartesian products of graphs
From MaRDI portal
Publication:1025971
Recommendations
- On the total \(\{k\}\)-domination number of Cartesian products of graphs
- On the total domination number of Cartesian products of graphs
- Total \(k\)-domination in Cartesian product graphs
- On domatic and total domatic numbers of Cartesian products of graphs
- On dominating the Cartesian product of a graph and K2
- On total domination in the Cartesian product of graphs
- Cartesian product graphs and \(k\)-tuple total domination
- On total $\{k\}$-domatic number of Cartesian and direct product of graphs
- Total \(k\)-domination in Cartesian product of complete graphs
- On the power domination number of the Cartesian product of graphs
Cites work
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 867701 (Why is no real title available?)
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- A partition approach to Vizing's conjecture
- An inequality related to Vizing's conjecture
- On graphs having domination number half their order
- On integer domination in graphs and Vizing-like problems
- Vizing's conjecture and the one-half argument
Cited in
(27)- 3-tuple total domination number of Rook's graphs
- From Italian domination in lexicographic product graphs to \(w\)-domination in graphs
- scientific article; zbMATH DE number 1129672 (Why is no real title available?)
- scientific article; zbMATH DE number 1996462 (Why is no real title available?)
- Graph products and integer domination. II
- On the Colin de Verdière numbers of Cartesian graph products
- On density of subgraphs of Cartesian products
- scientific article; zbMATH DE number 7144862 (Why is no real title available?)
- On dominating the Cartesian product of a graph and K2
- On Clark and Suen bound-type results for \(k\)-domination and Roman domination of Cartesian product graphs
- Bounds for complete cototal domination number of Cartesian product graphs and complement graphs
- Alliance free sets in Cartesian product graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- The \(\{k\}\)-domatic number of a graph
- 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
- From \(w\)-domination in graphs to domination parameters in lexicographic product graphs
- (Open) packing number of some graph products
- Packing and domination invariants on Cartesian products and direct products
- scientific article; zbMATH DE number 1439442 (Why is no real title available?)
- Leverage centrality of knight's graphs and Cartesian products of regular graphs and path powers
- The Menger number of the Cartesian product of graphs
- scientific article; zbMATH DE number 1792590 (Why is no real title available?)
- The integer \(\{k\}\)-domination number of circulant graphs
- Cartesian product graphs and \(k\)-tuple total domination
- Integer domination of Cartesian product graphs
- Vizing's conjecture: a survey and recent results
This page was built for publication: On the \(\{k\}\)-domination number of Cartesian products of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025971)