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 ≤ n ≤ m, γ(Gn,m) = [(n+2)(m+2)/5] - 4. © 2011 Society for Industrial and Applied Mathematics.
Author supplied keywords
Cite
CITATION STYLE
APA
Gonçalves, D., Pinlou, A., Rao, M., & Thomassé, S. (2011). The domination number of grids. SIAM Journal on Discrete Mathematics, 25(3), 1443–1453. https://doi.org/10.1137/11082574
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free