Nim on Graphs

Abstract

Winning strategies for the Game of Nim on Graphs are discussed. Graphs considered are distinguished from those previously studied in that they may have loops. Winning strategies are found for graphs that have loops and whose links form paths, cycles, trees, or monocyclic graphs. Furthermore, strategies are developed to approach games played on graphs that contain an induced tree with loops.