Abstract
dc:description.abstractIn this paper, we show how the canonical divisor of a graph is related to the canonical divisor of its subgraph. The use of chip firing and the adjunction formula for graphs ex- plains said relation and even completes it. We go on to show the difference between the formula for full subgraphs and that of non-full subgraphs. Examples are used to simplify these results and to see the adjunction formula in action. Finally, we show that though the adjunction formula seems simple at first glance, it is somewhat complex and rather useful.
Degree
thesis:*- Name thesis:degree_name
- Master of Science in Mathematics (M.S.)
- Level thesis:degree_level
- Thesis (open access)
- Discipline thesis:degree_discipline
- Department of Mathematical Sciences
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Harrelson, Paul M
- Contributors dc:contributor
-
- Enka Lakuriqi
- Hua Wang
Subjects
dc:subject × 4Rights
- Licence dc:rights.license
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.georgiasouthern.edu/etd/1950