Constructing ɣ-Sets [Gamma-Sets] of Grids
Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC)
A lot of research has been spent determining the domination numbers, γ m,n, of grid graphs. But relatively little effort has been given to constructing minimum dominating sets of grid graphs. In this paper, we introduce a method for constructing γ-sets of grid graphs Gm,n for all m ≥ 16 and n ≥ 16. Further, for Gm,n, m < 16, m ≠ 12, 13, we show how particular ɣ-sets can be used to construct ɣ-sets for other grid graphs.
Hutson, Kevin R., Stephen T. Hedetniemi, and Richard Forrester. "Constructing ɣ-Sets [Gamma-Sets] of Grids." Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC) 95 (2015): 3-26.
Full text currently unavailable.