Abstract
dc:description.abstractGraph invariants are functions defined on the graph structures that stay the same under taking graph isomorphisms. Many such graph invariants, including some commonly used graph indices in Chemical Graph Theory, are defined on vertex degrees and distances between vertices. We explore generalizations of such graph indices and the corresponding extremal problems in trees. We will also briefly mention the applications of our results.
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
-
- Bass, Rachel
- Contributors dc:contributor
-
- Daniel Gray
- Colton Magnant
Subjects
dc:subject × 4Rights
- Licence dc:rights.license
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.georgiasouthern.edu/etd/1548