The Connected Domination Number of Grids

11/23/2020 ∙ by Adarsh Srinivasan, et al. ∙ 0

Closed form expressions for the domination number of an n × m grid have attracted significant attention, and an exact expression has been obtained in 2011 by Gonçalves et al. In this paper, we present our results on obtaining new lower bounds on the connected domination number of an n × m grid. The problem has been solved for grids with up to 4 rows and with 6 rows by Tolouse et al and the best currently known lower bound for arbitrary m,n is ⌈mn/3⌉. Fujie came up with a general construction for a connected dominating set of an n × m grid of size min{2n+(m-4)+⌊m-4/3⌋(n-2), 2m+(n-4)+⌊n-4/3⌋(m-2) } . In this paper, we investigate whether this construction is indeed optimum. We prove a new lower bound of ⌈mn+2⌈min{m,n}/3⌉/3⌉ for arbitrary m,n ≥ 4.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.