Skip to Main content Skip to Navigation
Journal articles

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.
keyword : grid domination
Document type :
Journal articles
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00569256
Contributor : Alexandre Pinlou <>
Submitted on : Thursday, February 24, 2011 - 3:50:11 PM
Last modification on : Friday, December 13, 2019 - 9:32:04 AM
Document(s) archivé(s) le : Wednesday, May 25, 2011 - 2:50:59 AM

File

dg.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-00569256, version 1

Citation

Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé. The Domination Number of Grids. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2011, 25, pp.1443-1453. ⟨lirmm-00569256⟩

Share

Metrics

Record views

366

Files downloads

1573