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 |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-16949 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-169492021-11-13T03:54:02Z Chip firing games on the n-cycles and tree graphs Ching, Mike Lester L. 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. 1998-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/16436 Bachelor's Theses English Animo Repository Game theory Trees (Graph theory) Cycles, Algebraic Paths and cycles (Graph theory) |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Game theory Trees (Graph theory) Cycles, Algebraic Paths and cycles (Graph theory) |
| spellingShingle |
Game theory Trees (Graph theory) Cycles, Algebraic Paths and cycles (Graph theory) Ching, Mike Lester L. Chip firing games on the n-cycles and tree graphs |
| description |
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. |
| format |
text |
| author |
Ching, Mike Lester L. |
| author_facet |
Ching, Mike Lester L. |
| author_sort |
Ching, Mike Lester L. |
| title |
Chip firing games on the n-cycles and tree graphs |
| title_short |
Chip firing games on the n-cycles and tree graphs |
| title_full |
Chip firing games on the n-cycles and tree graphs |
| title_fullStr |
Chip firing games on the n-cycles and tree graphs |
| title_full_unstemmed |
Chip firing games on the n-cycles and tree graphs |
| title_sort |
chip firing games on the n-cycles and tree graphs |
| publisher |
Animo Repository |
| publishDate |
1998 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/16436 |
| _version_ |
1772835215306129408 |