Document Type

Honors Project On-Campus Access Only

Abstract

Graphs are mathematical structures that represent relationships (edges) between objects (vertices). We define chip-firing games on graphs by stacking chips on vertices and "firing" chips along edges, in an effort to eliminate a debt introduced on the graph. In this paper, we define and prove a variety of graph parameters related to winning this game efficiently for various graph families.

Download

Share

COinS
 
 

© Copyright is owned by author of this document