Georgia Southern University
Conflict Free Connectivity and the Conflict-Free-Connection Number of Graphs
Abstract
dc:description.abstractWe explore a relatively new concept in edge-colored graphs called conflict-free connectivity. A conflict-free path is a (edge-) colored path that has an edge with a color that appears only once. Conflict-free connectivity is the maximal number of internally disjoint conflict-free paths between all pairs of vertices in a graph. We also define the c-conflict-free-connection of a graph G. This is the maximum conflict-free connectivity of G over all c-colorings of the edges of G. In this paper we will briefly survey the works related to conflict-free connectivity. In addition, we will use the probabilistic method to achieve a bound on the c-conflict-free connection number of complete graphs.
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
-
- Wehmeier, Travis D
- Contributors dc:contributor
-
- Colton Magnant
- Daniel Gray
Subjects
dc:subject × 6Rights
- Licence dc:rights.license
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.georgiasouthern.edu/etd/1897