On the \k\-domination number of Cartesian products of graphs

DOI10.1016/J.DISC.2008.07.030zbMATH Open1189.05132OpenAlexW2001588067MaRDI QIDQ1025971FDOQ1025971

Authors: You Lu, Xinmin Hou 

Publication date: 23 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.07.030

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 K₂
• 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

zbMATH Keywords

domination numberCartesian productpacking number\(\{k\}\)-domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On graphs having domination number half their order
• An inequality related to Vizing's conjecture
• On integer domination in graphs and Vizing-like problems
• Vizing's conjecture and the one-half argument
• A partition approach to Vizing's conjecture

Cited In (27)

• The Menger number of the Cartesian product of graphs
• Vizing's conjecture: a survey and recent results
• From Italian domination in lexicographic product graphs to \(w\)-domination in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Alliance free sets in Cartesian product graphs
• Title not available (Why is that?)
• The integer \(\{k\}\)-domination number of circulant graphs
• 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
• The \(\{k\}\)-domatic number of a graph
• Packing and domination invariants on Cartesian products and direct products
• Cartesian product graphs and \(k\)-tuple total domination
• On density of subgraphs of Cartesian products
• On dominating the Cartesian product of a graph and K₂
• From \(w\)-domination in graphs to domination parameters in lexicographic product graphs
• 3-tuple total domination number of Rook's graphs
• Domination parameters with number 2: interrelations and algorithmic consequences
• (Open) packing number of some graph products
• On the Colin de Verdière numbers of Cartesian graph products
• Graph products and integer domination. II
• Bounds for complete cototal domination number of Cartesian product graphs and complement graphs
• Integer domination of Cartesian product graphs
• Title not available (Why is that?)
• Leverage centrality of knight's graphs and Cartesian products of regular graphs and path powers
• On Clark and Suen bound-type results for \(k\)-domination and Roman domination of Cartesian product graphs
• Title not available (Why is that?)

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)