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.

This document is currently not available here.

Share

COinS