Chip firing games on the n-cycles and tree graphs

Date of Publication

1998

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Abstract/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.

Abstract Format

html

Language

English

Format

Print

Accession Number

TU08296

Shelf Location

Archives, The Learning Commons, 12F Henry Sy Sr. Hall

Physical Description

46 leaves

Keywords

Game theory; Trees (Graph theory); Cycles, Algebraic; Paths and cycles (Graph theory)

This document is currently not available here.

Share

COinS