Double Domination of Complementary Prisms.

<p>The complementary prism of a graph <em>G</em> is obtained from a copy of <em>G</em> and its complement <em>G&#773;</em> by adding a perfect matching between the corresponding vertices of <em>G</em> and <em>G&#773;</em>. For any graph <em>G</em>, a set <em>D</em> &#8838; <em>V</em> (<em>G</em>) is a <em>double dominating set</em> (DDS) if that set dominates every vertex of <em>G</em> twice. The <em>double domination number</em>, denoted &#947;_&#215;2(<em>G</em>), is the cardinality of a minimum double dominating set of <em>G</em>. We have proven results on graphs of small order, specific families and lower bounds on &#947;_&#215;2(GG&#773;).</p>

Name thesis:degree_name

MS (Master of Science)

Level thesis:degree_level

Thesis - unrestricted

Discipline thesis:degree_discipline

Mathematical Sciences

Year dc:date.issued

2008

Author dc:creator

• Vaughan, Lamont D

• complementary prism
• double domination
• domination
• graph theory
• Discrete Mathematics and Combinatorics
• Mathematics
• Physical Sciences and Mathematics

Statement dc:rights

• Copyright by the authors.

Repository record dc:identifier

https://dc.etsu.edu/etd/1983

OAI identifier oai:identifier

oai:dc.etsu.edu:etd-3335