MS (Master of Science)
Date of Award
Committee Chair or Co-Chairs
Teresa W. Haynes
Robert B. Gardner, Debra J. Knisley
The Queen’s domination problem has a long and rich history. The problem can be simply stated as: What is the minimum number of queens that can be placed on a chessboard so that all squares are attacked or occupied by a queen? The problem has been expanded to include not only the standard 8x8 board, but any rectangular m×n sized board. In this thesis, we consider both paired and total domination versions of this renowned problem.
Thesis - unrestricted
Burchett, Paul Asa, "Paired and Total Domination on the Queen's Graph." (2005). Electronic Theses and Dissertations. Paper 1055. https://dc.etsu.edu/etd/1055
Copyright by the authors.