Abstract
dc:description.abstractThe majority of graph theory research on parameters involved with domination, independence, and irredundance has focused on either sets of vertices or sets of edges; for example, sets of vertices that dominate all other vertices or sets of edges that dominate all other edges. There has been very little research on ``mixing'' vertices and edges. We investigate several new and several little-studied parameters, including vertex-edge domination, vertex-edge irredundance, vertex-edge independence, edge-vertex domination, edge-vertex irredundance, and edge-vertex independence.
Degree
thesis:*- Name thesis:degree_name
- Doctor of Philosophy (PhD)
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Computer Science
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Lewis, Jason
- Contributors dc:contributor
-
- Hedetniemi, Stephen T
- Dean , Brian C
- Haynes , Teresa W
- McRae , Alice A
- Duchowski , Andrew T
Subjects
dc:subject × 5Identifiers
dc:identifier.*- Repository record dc:identifier
- https://open.clemson.edu/all_dissertations/103