Global Domination Edge Critical Graphs
Document Type
Article
Publication Date
9-1-2017
Description
A set S of vertices in a graph G is a global dominating set of G if 5 simultaneously 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 study the graphs for which removing any arbitrary edge from G and adding it to G decreases the global domination number.
Citation Information
Desormeaux, Wyatt J.; Haynes, Teresa W.; and Van Der Merwe, Lucas. 2017. Global Domination Edge Critical Graphs. Utilitas Mathematica. Vol.104 151-160. ISSN: 0315-3681