Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 3 of 3 for “"Graph domination"”.
-
Degree Ramsey theory, game and Roman domination, and game saturation in graphs
"We examine several problems in extremal graph theory, emphasizing problems involving games on graphs. In Chapter 2, we study a variant of Ramsey theory, seeking Ramsey hosts with small maximum degree. We focus on finding such hosts for trees and cycles. In Chapter 3 we consider the ""on-line"" …
-
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 …