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

DOI10.1007/S00373-014-1486-1zbMATH Open1327.05255OpenAlexW2010454822MaRDI QIDQ497315FDOQ497315

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

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

zbMATH Keywords

boxgraph dominationCartesian productstairway

Mathematics Subject Classification ID

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

Cites Work

• Domination-balanced graphs
• Rainbow domination in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Topics in graph theory. Graphs and their Cartesian product
• Title not available (Why is that?)
• Vizing's conjecture: a survey and recent results
• Title not available (Why is that?)

Cited In (4)

• On unique minimum dominating sets in some repeated Cartesian products
• Title not available (Why is that?)
• 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)