Constructing ɣ-Sets [Gamma-Sets] of Grids
Public Deposited
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.
For more information on the published version, visit JCMCC's Website.
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.
MLA citation style (9th ed.)
Constructing Ɣ-sets [gamma-sets] of Grids. . 2015. dickinson.hykucommons.org/concern/generic_works/a709c9d6-adea-4074-abd1-b83ee50b4eb2.APA citation style (7th ed.)
(2015). Constructing ɣ-Sets [Gamma-Sets] of Grids. https://dickinson.hykucommons.org/concern/generic_works/a709c9d6-adea-4074-abd1-b83ee50b4eb2Chicago citation style (CMOS 17, author-date)
Constructing Ɣ-Sets [gamma-Sets] of Grids. 2015. https://dickinson.hykucommons.org/concern/generic_works/a709c9d6-adea-4074-abd1-b83ee50b4eb2.Note: These citations are programmatically generated and may be incomplete.