Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"2-Domination"”.

  1. The 2-Domination Number of a Caterpillar

    … 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 …

    etsu Repository record for The 2-Domination Number of a Caterpillar (opens in a new tab) Download PDF for The 2-Domination Number of a Caterpillar (opens in a new tab)

  2. Italian Domination in Complementary Prisms

    … all such functions on $G$ is called the Italian domination number. In this thesis we will study Italian domination in complementary prisms. First we will present an error found in one of the references. Then we will define the small values of the Italian domination in complementary prisms, find …

    etsu Repository record for Italian Domination in Complementary Prisms (opens in a new tab) Download PDF for Italian Domination in Complementary Prisms (opens in a new tab)

  3. Distance-2 Domatic Numbers of Graphs

    The distance d(u, v) between two vertices u and v in a graph G equals the length of a shortest path from u to v. A set S of vertices is called a distance-2 dominating set if every vertex in V \S is within distance-2 of at least one vertex in S. The distance-2 domatic number is the maximum number of …

    etsu Repository record for Distance-2 Domatic Numbers of Graphs (opens in a new tab) Download PDF for Distance-2 Domatic Numbers of Graphs (opens in a new tab)