A Lower Bound For Domination Numbers Of The Queen’s Graph: Addendum

Abstract

In the paper [3], the theorem that at least $\frac{n–1}{2}$ queens are required to dominate the $n\times n$ chessboard was attributed to P. H. Spencer, in [1]. A proof of this result appeared in the earlier work [2].