Abstract
dc:description.abstractFricke, Haynes, Hedetniemi, Hedetniemi, and Laskar introduced the following concept. For a graph G = (V,E), let rho denote a property of interest concerning sets of vertices. A vertex u is rho-good if u is contained in a {minimum, maximum} rho-set in G and rho-bad if u is not contained in a rho-set. Let g denote the number of rho-good vertices and b denote the number of rho-bad vertices. A graph G is called rho-excellent if every vertex in V is rho-good, rho-commendable if g > b > 0, rho-fair if g = b, and rho-poor if g < b. In this thesis the property of interest is total domination. The total domination number, gammat, is the cardinality of a smallest total dominating set in a graph. We investigate gammat-excellent, gammat-commendable, gammat-fair, and gammat-poor graphs.
Degree
thesis:*- Name thesis:degree_name
- MS (Master of Science)
- Level thesis:degree_level
- Thesis - unrestricted
- Discipline thesis:degree_discipline
- Mathematical Sciences
- Year dc:date.issued
- 2000
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Dautermann, Robert Elmer, III
Subjects
dc:subject × 5Rights
dc:rights- Statement dc:rights
-
- Copyright by the authors.
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://dc.etsu.edu/etd/5