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: | Ching, Mike Lester L. |
---|---|
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 |
Similar Items
-
The b-chromatic number of power graphs of paths and cycles
by: San Diego, Immanuel T.
Published: (2005) -
On graceful graphs
by: Paculba, Marianne S., et al.
Published: (1998) -
A characterization theorem on graph folding
by: Gervacio, Severino V.
Published: (2002) -
On degree sums, k-factors, and Hamiltonian cycles in graphs
by: Hernandez, Alana Margarita R.
Published: (2002) -
On oriented trails in a class of graphs (with computer program)
by: Arnaez, Ma. Cristina K., et al.
Published: (1994)