East Tennessee State University
Explorations in the Classification of Vertices as Good or Bad.
Abstract
dc:description.abstractFor a graph G, a set S is a dominating set if every vertex in V-S has a neighbor in S. A vertex contained in some minimum dominating set is called good; otherwise it is bad. A graph G has g(G) good vertices and b(G) bad vertices. The relationship between the order of G and g(G) assigns the graph to one of four classes. Our results include a method of classifying caterpillars. Further, we develop realizability conditions for a graph G given a triple of nonnegative integers representing the domination number of γ(G), g(G), and b(G), respectively, and provide constructions of graphs meeting those conditions. We define the goodness index of a vertex v in a graph G as the ratio of distinct γ(G)-sets containing v to the total number of γ(G)-sets, and provide formulas that yield the goodness index of any vertex in a given path.
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
- 2001
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Jackson, Eugenie Marie
Subjects
dc:subject × 13Rights
dc:rights- Statement dc:rights
-
- Copyright by the authors.
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://dc.etsu.edu/etd/132