1 |
Global Domination Edge Critical GraphsDesormeaux, Wyatt J., Haynes, Teresa W., Van Der Merwe, Lucas 01 September 2017 (has links)
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.
|
Page generated in 0.1504 seconds