Abstract
dc:description.abstract<p>A <em>fullerene</em> is a 3-regular plane graph consisting only of pentagonal and hexagonal faces. Fullerenes are designed to model carbon molecules. The <em>Clar number</em> and <em>Fries number</em> are two parameters that are related to the stability of carbon molecules. We introduce <em>chain decompositions</em>, a new method to find lower bounds for the Clar and Fries numbers. In Chapter 3, we define the <em>Clar structure</em> for a fullerene, a less general decomposition designed to compute the Clar number for classes of fullerenes. We use these new decompositions to understand the structure of fullerenes and achieve several results. In Chapter 4, we classify and give a construction for all fullerenes on |<em>V</em>| vertices that attain the maximum Clar number |<em>V</em>|/6 - 2. In Chapter 5, we settle an open question with a counterexample: we construct an infinite family of fullerenes for which a set of faces attaining the Clar number cannot be a subset of a set of faces that attains the Fries number. We develop a method to calculate the Clar number directly for many infinite families of fullerenes</p>
Degree
thesis:*- Name thesis:degree_name
- Doctor of Philosophy (PhD)
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematics
- Year
- 2012
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Hartung, Elizabeth Jane
- Contributors dc:contributor
-
- Jack E. Graver
Subjects
dc:subject × 5Identifiers
dc:identifier.*- Repository record dc:identifier
- https://surface.syr.edu/mat_etd/69
- OAI identifier oai:identifier
- oai:surface.syr.edu:mat_etd-1068