Abstract
dc:description.abstractA set D of vertices in a graph G is a 2-dominating set of G if every vertex in V − D has at least two neighbors in D. The 2-domination number of a graph G, denoted by γ2(G), is the minimum cardinality of a 2- dominating set of G. In this thesis, we discuss the 2-domination number of a special family of trees, called caterpillars. A caterpillar is a graph denoted by Pk(x1, x2, ..., xk), where xi is the number of leaves attached to the ith vertex of the path Pk. First, we present the 2-domination number of some classes of caterpillars. Second, we consider several types of complete caterpillars. Finally, we consider classification of caterpillars with respect to their spine length and 2-domination number.
Degree
thesis:*- Name thesis:degree_name
- MS (Master of Science)
- Level thesis:degree_level
- Thesis - unrestricted
- Discipline thesis:degree_discipline
- Mathematical Sciences
- Grantor dc:publisher
- East Tennessee State University
- Year dc:date.issued
- 2018
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Chukwukere, Presley
Subjects
dc:subject × 4Rights
dc:rights- Statement dc:rights
-
- Copyright by the authors.
- Language dc:language
- eng
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://dc.etsu.edu/etd/3456