There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Abstract
In this paper, we conclude the calculation of the domination number of all
\(n\times m\) grid graphs. Indeed, we prove Chang's conjecture saying that for
every \(16\le n\le m\), \(\gamma(G_{n,m})=\lfloor\frac{(n+2)(m+2)}{5}\rfloor -4\).