A New Lower Bound for the Domination Number of Complete Cylindrical Grid Graphs
Combinatorics
2022-08-01 v1
Abstract
We use a dynamic programming algorithm to establish a lower bound on the domination number of complete grid graphs of the form , that is, the Cartesian product of a cycle and a path , for and sufficiently large.
Cite
@article{arxiv.2207.14414,
title = {A New Lower Bound for the Domination Number of Complete Cylindrical Grid Graphs},
author = {David R. Guichard},
journal= {arXiv preprint arXiv:2207.14414},
year = {2022}
}