Chessboard Domination: Introduction of Some New Problems
摘要
For a positive integer n, considering the \(n\times n\) chessboard, for a chess piece P, one is interested in the graph \(P_{n}\) by taking the squares of the chessboard as its vertices where two squares are adjacent if the piece P situated at one of the squares is able to move directly to the other. After recalling some known results and open questions on the domination number \(\gamma (P_n)\) for the square board \(P_n\) , we here introduce some new questions.