The 2-domination and Roman domination numbers of grid graphs

Abstract

We investigate the 2-domination number for grid graphs, that is the size of a smallest set $D$ of vertices of the grid such that each vertex of the grid belongs to $D$ or has at least two neighbours in $D$. We give a closed formula giving the 2-domination number of any $n\times m$ grid, hereby confirming the results found by Lu and Xu, and Shaheen et al. for $n\le 4$ and slightly correct the value of Shaheen et al. for $n=5$. The proof relies on some dynamic programming algorithms, using transfer matrices in (min,+)-algebra. We also apply the method to solve the Roman domination problem on grid graphs.

11 pages, 5 figures, presented at ICGT 2018 The program that led to the results is included in the Source directory (see Other formats) Accepted in DMTCS vol 21. Journal version with their template

References in corpus (1)

• The 2-Domination and 2-Bondage Numbers of Grid Graphs

Cited by in corpus (2)

• Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
• Signed double Roman domination on cubic graphs