Cockayne, E. J.2010-03-312010-03-3119862010-03-31http://hdl.handle.net/1828/2415A graph may be formed from an n x n chessboard by taking the squares as the vertices and two vertices are adjacent if a chess piece situated on one square covers the other. In this paper we survey some recent results concerning domination parameters for certain graphs constructed in this way from the moves of queens and bishops.entechnical reports (mathematics and statistics)Technical ReportDepartment of Mathematics and Statistics