The game "Generalized Kayles (or Independence Achievement)" is played by two players A and B on an arbitrary graph G. The players alternate removing a vertex and its neighbors from G, the winner being the last player with a nonempty set from which to choose. In this thesis, we present winning strategies for some paths.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etd-1954 |
| Date | 11 August 2003 |
| Creators | Taylor, Mark C. |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Electronic Theses and Dissertations |
| Rights | Copyright by the authors. |
Page generated in 0.0014 seconds