Degree Name

MS (Master of Science)

Program

Mathematical Sciences

Date of Award

5-2013

Committee Chair or Co-Chairs

Robert A. Beeler

Committee Members

Robert B. Gardner, Anant P. Godbole, Teresa W. Haynes

Abstract

In a paper by Beeler and Hoilman, the traditional game of peg solitaire is generalized to graphs in the combinatorial sense. One of the important open problems in this paper was to classify solvable trees. In this thesis, we will give necessary and sufficient conditions for the solvability for all trees with diameter four. We also give the maximum number of pegs that can be left on such a graph under the restriction that we jump whenever possible.

Document Type

Thesis - Open Access

Copyright

Copyright by the authors.

Share

COinS