We consider the domination number of the queens graph Q"n and show that if, for some fixed k, there is a dominating set of Q"4"k"+"1 of a certain type with cardinality 2k+1, then for any n large enough, @c(Q"n)= =1 and n=2(6m-1)(2k+1)-1, @c(Q"n^t)=<[(2k+3)/(4k+2)]n+O(1), where Q"n^t is the toroidal nxn queens graph.
['Alewyn P. Burger', 'Christina M. Mynhardt']
An improved upper bound for queens domination numbers