The Domination Number of Grids
Gonçalves, Daniel · Pinlou, Alexandre · Rao, Michael · Thomassé, Stéphan
Original · EN
In this paper, we conclude the calculation of the domination number of all n× m grid graphs. Indeed, we prove Chang's conjecture saying that for every 16≤ n≤ m, γ(Gₙ,ₘ)=(n+2)(m+2)/5 -4.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.