Degree Name

MS (Master of Science)

Program

Mathematical Sciences

Date of Award

8-2003

Committee Chair or Co-Chairs

Teresa W. Haynes

Committee Members

Debra J. Knisley, Anant P. Godbole

Abstract

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.

Document Type

Thesis - Open Access

Copyright

Copyright by the authors.

Share

COinS