Global Domination Stable Graphs

<p>A set of vertices <i>S</i> in a graph <i>G</i> is a global dominating set (GDS) of <i>G</i> if <i>S</i> is a dominating set for both <i>G</i> and its complement <i>G</i>. The minimum cardinality of a global dominating set of <i>G</i> is the global domination number of <i>G</i>. We explore the effects of graph modifications on the global domination number. In particular, we explore edge removal, edge addition, and vertex removal.</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

2012

Author dc:creator

• Harris, Elizabeth Marie

• Global Domination
• Graph Theory
• Stable
• Mathematics
• Discrete Mathematics and Combinatorics
• Physical Sciences and Mathematics

Statement dc:rights

• Copyright by the authors.

Repository record dc:identifier

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

OAI identifier oai:identifier

oai:dc.etsu.edu:etd-2669