Paired and Total Domination on the Queen's Graph.

<p>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 <em>m<em>&#215;<em>n</em> sized board. In this thesis, we consider both paired and total domination versions of this renowned problem.</p>

Name thesis:degree_name

MS (Master of Science)

Level thesis:degree_level

Thesis - unrestricted

Discipline thesis:degree_discipline

Mathematical Sciences

Year dc:date.issued

2005

Author dc:creator

• Burchett, Paul Asa

• Queen's graph
• domination
• paired domination
• total domination
• chess
• Applied Mathematics
• Physical Sciences and Mathematics

Statement dc:rights

• Copyright by the authors.

Repository record dc:identifier

https://dc.etsu.edu/etd/1055

OAI identifier oai:identifier

oai:dc.etsu.edu:etd-2212