2-limited broadcast domination on grid graphs
arXiv:2110.08938 · doi:10.1016/j.dam.2023.05.031
Abstract
We establish upper and lower bounds for the 2-limited broadcast domination number of various grid graphs, in particular the Cartesian product of two paths, a path and a cycle, and two cycles. The upper bounds are derived by explicit constructions. The lower bounds are obtained via linear programming duality by finding lower bounds for the fractional 2-limited multipacking numbers of these graphs.