The Domination Number of Grids
Abstract
In this paper, we conclude the calculation of the domination number of all n×m grid graphs. Indeed, we prove Chang's conjecture saying that for every $16 \leq n \leq m, \gamma(G_n,m) = \left\lfloor((n+2)(m+2))/5\right\rfloor - 4.
Domains
Discrete Mathematics [cs.DM]| Origin | Files produced by the author(s) |
|---|
Loading...