Degree Name

MS (Master of Science)

Program

Mathematical Sciences

Date of Award

8-2008

Committee Chair or Co-Chairs

Teresa W. Haynes

Committee Members

Anant P. Godbole, Robert B. Gardner

Abstract

The complementary prism of a graph G is obtained from a copy of G and its complement by adding a perfect matching between the corresponding vertices of G and . For any graph G, a set DV (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̅).

Document Type

Thesis - Open Access

Copyright

Copyright by the authors.

Share

COinS