On Cartesian products having a minimum dominating set that is a box or a stairway

DOI10.1007/S00373-014-1486-1MaRDI QIDQ497315zbMATH OpenOpenAlexFDO

Authors Boštjan Brešar, Douglas F. Rall

Publication date 24 September 2015

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-014-1486-1

zbMATH Keywords

boxgraph dominationCartesian productstairway

Mathematics Subject Classification ID

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

Recommendations

• Some results on domination number of products of graphs
• On unique minimum dominating sets in some Cartesian product graphs
• On dominating the Cartesian product of a graph and K₂
• Paired domination of Cartesian products of graphs
• On unique minimum dominating sets in some repeated Cartesian products

Cites work

• scientific article; zbMATH DE number 21746 (Why is no real title available?)
• scientific article; zbMATH DE number 3284071 (Why is no real title available?)
• scientific article; zbMATH DE number 3308993 (Why is no real title available?)
• scientific article; zbMATH DE number 3358515 (Why is no real title available?)
• Domination-balanced graphs
• Rainbow domination in graphs
• Topics in graph theory. Graphs and their Cartesian product
• Vizing's conjecture: a survey and recent results

Cited in

(4)

• On unique minimum dominating sets in some repeated Cartesian products
• scientific article; zbMATH DE number 2114506 (Why is no real title available?)
• On unique minimum dominating sets in some Cartesian product graphs
• Rainbow domination in graphs

This page was built for publication: On Cartesian products having a minimum dominating set that is a box or a stairway

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