The Domination Number of Grids
Overview & Synopsis
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.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | The Domination Number of Grids |
|---|---|
| Author / Organization | Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2011 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-219662 |
| Original Source Link | Visit Source Page on hal.science » |