Bounds on the Global Domination Number

A set S of vertices in a graph G is a global dominating set of G if S simultaneously dominates both G and its complement Ḡ. The minimum cardinality of a global dominating set of G is the global domination number of G. We determine bounds on the global domination number of a graph and relationships b...

Full description

Saved in:

Bibliographic Details
Published in:	Quaestiones mathematicae Vol. 38; no. 4; pp. 563 - 572
Main Authors:	Desormeaux, Wyatt J., Gibson, Philip E., Haynes, Teresa W.
Format:	Journal Article
Language:	English
Published:	Grahamstown Taylor & Francis 04-07-2015 Taylor & Francis Ltd
Subjects:	Chief executive officers connected domination Entrepreneurs Global domination global domination number total domination
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	A set S of vertices in a graph G is a global dominating set of G if S simultaneously dominates both G and its complement Ḡ. The minimum cardinality of a global dominating set of G is the global domination number of G. We determine bounds on the global domination number of a graph and relationships between it and other domination related parameters.
ISSN:	1607-3606 1727-933X
DOI:	10.2989/16073606.2014.981728