Improving some bounds for dominating Cartesian products

DOI10.7151/DMGT.1201MaRDI QIDQ4823307zbMATH OpenOpenAlexFDO

Authors Douglas F. Rall, Bert L. Hartnell

Publication date 27 October 2004

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/7e92d320fe082c226601c6ddedbd53c16e8009c5

zbMATH Keywords

dominationVizing's conjecture

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1416478
• Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs
• A domination algorithm for generalized Cartesian products
• scientific article; zbMATH DE number 1792635
• Domination of generalized Cartesian products
• scientific article; zbMATH DE number 1124600
• On total domination in the Cartesian product of graphs
• scientific article; zbMATH DE number 2109312
• On the total domination number of Cartesian products of graphs
• On the upper total domination number of Cartesian products of graphs

Cited in

(8)

• On the total domination number of Cartesian products of graphs
• Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs
• Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
• Vizing's conjecture: a survey and recent results
• Power domination of the Cartesian product of graphs
• (Open) packing number of some graph products
• scientific article; zbMATH DE number 1416478 (Why is no real title available?)
• A tight upper bound on the average order of dominating sets of a graph

This page was built for publication: Improving some bounds for dominating Cartesian products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4823307)