MS (Master of Science)
Date of Award
Committee Chair or Co-Chairs
Teresa W. Haynes
Robert A. Beeler, Robert B. Gardner
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 sets in a partition of the vertices of G into distance-2 dominating sets. We give bounds on the distance-2 domatic number of a graph and determine the distance-2 domatic number of selected classes of graphs.
Thesis - unrestricted
Kiser, Derek, "Distance-2 Domatic Numbers of Graphs" (2015). Electronic Theses and Dissertations. Paper 2505. https://dc.etsu.edu/etd/2505
Copyright by the authors.