Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

A Lower Bound for the Domination Number of Complete Grid Graphs

David R. Guichard
  • Published: 31/05/2004

Abstract

We use a dynamic programming algorithm to establish a lower bound on the domination number of complete grid graphs \( G_{m,n} \). The bound is within \( 5 \) of a known upper bound that has been conjectured to be the exact domination number of the complete grid graphs.

Keywords: grid graph, domination number AMS classification: 05069
Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
David R. Guichard. A Lower Bound for the Domination Number of Complete Grid Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 049. 215-220. DOI: .