A domination algorithm for generalized Cartesian products

MaRDI QIDQ3003876zbMATH OpenFDO

Authors Stephen Benecke, Christina M. Mynhardt

Publication date 31 May 2011

zbMATH Keywords

Cartesian product graphdomination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99)

Recommendations

• A note on the domination number of the Cartesian products of paths and cycles
• On the domination number of the Cartesian product of the cycle of length n and any graph
• On dominating the Cartesian product of a graph and K₂
• Total domination of Cartesian products of graphs
• Domination number of the cross product of paths

Cited in

(3)

• Improving some bounds for dominating Cartesian products
• A note on the domination number of the Cartesian products of paths and cycles
• Domination of generalized Cartesian products

This page was built for publication: A domination algorithm for generalized Cartesian products

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