Domination Polynomial of the Rook Graph

Abstract

A placement of chess pieces on a chessboard is called dominating, if each free square of the chessboard is under attack by at least one piece. In this contribution we compute the number of dominating arrangements of $k$ rooks on an $n\times m$ chessboard. To this end we derive an expression for the corresponding generating function, the domination polynomial of the $n\times m$ rook graph.