Return to search

Global Domination Stable Trees

A set of vertices in a graph G is a global dominating set of G if it dominates both G and its complement G. The minimum cardinality of a global dominating set of G is the global domination number of G. We explore the effects of graph modifications (edge removal, vertex removal, and edge addition) on the global domination number. In particular, for each graph modification, we study the global domination stable trees, that is, the trees whose global domination number remains the same upon the modification. We characterize these stable trees having small global domination numbers.

Identiferoai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-16071
Date08 May 2013
CreatorsStill, Elizabeth Marie, Haynes, Teresa W.
PublisherDigital Commons @ East Tennessee State University
Source SetsEast Tennessee State University
Detected LanguageEnglish
Typetext
SourceETSU Faculty Works

Page generated in 0.0018 seconds