The Domination Number of C_n\square P_m for n\equiv 2\pmod{5}
From MaRDI portal
Publication:6406491
arXiv2208.00004MaRDI QIDQ6406491FDOQ6406491
Authors: David R. Guichard 
Publication date: 28 July 2022
Abstract: We use a dynamic programming algorithm to establish a new lower bound on the domination number of complete cylindrical grid graphs of the form , that is, the Cartesian product of a path and a cycle, when , and we establish a new upper bound equal to the lower bound, thus computing the exact domination number for these graphs.
This page was built for publication: The Domination Number of $C_n\square P_m$ for $n\equiv 2\pmod{5}$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6406491)
