The secure domination number of Cartesian products of small graphs with paths and cycles

DOI10.1016/j.dam.2021.11.008zbMath1486.05230arXiv2103.01406OpenAlexW3216286449MaRDI QIDQ2065763

Alex Newcombe, Michael Haythorpe

Publication date: 13 January 2022

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

Full work available at URL: https://arxiv.org/abs/2103.01406

zbMATH Keywords

pathscyclesCartesian productsecure domination

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roman domination number of the Cartesian products of paths and cycles
• Computing the domination number of grid graphs
• The domination numbers of cylindrical grid graphs
• An improved binary programming formulation for the secure domination problem
• Roman domination in graphs.
• On computing a minimum secure dominating set in block graphs
• The complexity of secure domination problem in graphs
• Dominating Cartesian products of cycles
• A linear algorithm for secure domination in trees
• The Domination Number of Grids
• Protection of graphs with emphasis on Cartesian product graphs
• Roman domination in Cartesian product graphs and strong product graphs

This page was built for publication: The secure domination number of Cartesian products of small graphs with paths and cycles