Chip firing games on the n-cycles and tree graphs
This thesis discusses the theory of Chip-Firing Games on Graphs in an expository fashion. Chip-Firing Games constitute the passing of objects on a graph, called chips, from one node to another. The action of passing chips is called a firing, from which the game acquires it's name. The greate...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1998
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16436 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | This thesis discusses the theory of Chip-Firing Games on Graphs in an expository fashion. Chip-Firing Games constitute the passing of objects on a graph, called chips, from one node to another. The action of passing chips is called a firing, from which the game acquires it's name. The greater part of the material in this thesis is based on the similarly titled article Chip-Firing Games on n-Cycles by Janice Jeffs and Suzanne Seager, and where necessary the equations and proofs mirror those given in that article. Most of the Theorems in this study were from said paper, with the exception of one Theorem on Trees done by the writer. |
|---|