Date on Honors Thesis
Fall 11-29-2023
Major
Mathematics
Minor
Computer Science
Examining Committee Member
Dr. Elizabeth A. Donovan
Examining Committee Member
Dr. Robert G. Donnelly
Examining Committee Member
Dr. David Roach
Abstract/Description
From the traditional game of Solitaire to modern video games like Candy Crush and Five Nights at Freddy’s, single-player games have captivated audiences for gener- ations. We investigate a lesser-known single-player game, the Jumping Frogs problem, on various classes of simple graphs, a graph with no multiple edges or looped ver- tices. We determine whether frogs can be stacked together on one vertex of a given graph. In a graph with k vertices and one frog on each vertex, the frogs must make legal jumps to form a stack of k frogs. The problem is known to be solvable on classes of trees, but no work has yet been done on cyclic graphs. We examine various classes of cyclic graphs and determine whether these graphs have the property we call partyability.
Recommended Citation
Mitchell, Jake, "Jumping Frogs on Cyclic Graphs" (2023). Honors College Theses. 201.
https://digitalcommons.murraystate.edu/honorstheses/201
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License