11
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      The Domination Number of Grids

      Preprint
      , , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

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

          Related collections

          Most cited references1

          • Record: found
          • Abstract: not found
          • Article: not found

          The domination numbers of the 5 ×n and 6 ×n grid graphs

            Bookmark

            Author and article information

            Journal
            25 February 2011
            Article
            10.1137/11082574
            1102.5206
            3e3dbea0-0103-4dd6-a84b-034ea350c481

            http://arxiv.org/licenses/nonexclusive-distrib/1.0/

            History
            Custom metadata
            LIRMM RR-11007
            SIAM Journal of Discrete Mathematics, vol. 25, pp. 1443-1453, 2011
            12 pages, 4 figures
            cs.DM

            Comments

            Comment on this article