Degree Name

MS (Master of Science)

Program

Mathematical Sciences

Date of Award

8-2018

Committee Chair or Co-Chairs

Rodney Keaton

Committee Members

Robert A. Beeler, Teresa W. Haynes

Abstract

A 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.

Document Type

Thesis - Open Access

Copyright

Copyright by the authors.

Included in

Mathematics Commons

Share

COinS