Virginia Commonwealth University
Problems in Graph Theory With Applications to Topology and Modeling RNA
Abstract
dc:description.abstractIn this thesis, we explore four projects. In the first project, we explore $r$-neighbor bootstrap percolation on a graph $G$. We establish upper bounds for the number of vertices required to percolate in the case that $r=2$ for particular classes of graphs. In the second project, we study the structure of graphs with independence number two. We prove a lower bound on the number of edges of such graphs, related to an upper bound on the number of edges in a triangle-saturated graph, and give a sufficient forbidden induced subgraph condition for independence number two graphs. In the third project, we extend an existing method and provide a robust framework for studying and analyzing the structure of RNA molecules via chord diagrams and graph theory. In the fourth project, we prove that existing graph theoretic results on spanning tree enumeration in symmetric graphs may be applied to calculate determinants of simple theta curves.
Degree
thesis:*- Name thesis:degree_name
- Doctor of Philosophy
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Systems Modeling and Analysis
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Ibrahim, Rayan K
- 0000-0002-4578-5230
- Contributors dc:contributor
-
- Craig Larson
- Allison H. Moore
Subjects
dc:subject × 7Rights
dc:rights- Statement dc:rights
-
- © The Author
Identifiers
dc:identifier.*- Identifier
- https://scholarscompass.vcu.edu/etd/7780