MS (Master of Science)
Date of Award
Committee Chair or Co-Chairs
Teresa W. Haynes
Anant P. Godbole, Robert B. Gardner
The complementary prism of a graph G is obtained from a copy of G and its complement G̅ by adding a perfect matching between the corresponding vertices of G and G̅. For any graph G, a set D ⊆ V (G) is a double dominating set (DDS) if that set dominates every vertex of G twice. The double domination number, denoted γ×2(G), is the cardinality of a minimum double dominating set of G. We have proven results on graphs of small order, specific families and lower bounds on γ×2(GG̅).
Thesis - Open Access
Vaughan, Lamont D., "Double Domination of Complementary Prisms." (2008). Electronic Theses and Dissertations. Paper 1983. http://dc.etsu.edu/etd/1983
Copyright by the authors.