The domination numbers of the 5 × n and 6 × n grid graphs
Tony Yu Chang, W. Edwin Clark · Journal of Graph Theory · 1993
Abstract The k × n grid graph is the product Pk × Pn of a path of length k − 1 and a path of length n − 1. We prove here formulas found by E. O. Hare for the domination numbers of P5 × Pn and P6 × Pn. © 1993 John Wiley & Sons, Inc.