Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
The 2-Domination Number Of A Caterpillar, Presley Chukwukere
The 2-Domination Number Of A Caterpillar, Presley Chukwukere
Electronic Theses and Dissertations
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 …