The Domination Number of Grids

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$, $γ(G_{n,m})=\lfloor\frac{(n+2)(m+2)}{5}\rfloor -4$.

No reviews yet.

No comments yet.