Queenʹs domination using border squares and image-restricted domination

In this paper we introduce a variant on the long studied, highly entertaining, and very difficult problem of determining the domination number of the queenʹs chessboard graph, that is, determining how few queens are needed to protect all of the squares of a k by k chessboard. Motivated by the problem of minimum redundance domination, we consi