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 1 of 1 for “"Distance-2 Domination"”.

  1. 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)