The global domination number of a graph

A set of vertices of a graph G is said to be a global dominating set of G if it dominates G as well as G¯¯¯. The global domination number of G is the minimum cardinality of a global dominating set of G and the global domatic number of G is the maximum order of a partition {V1,⋯,Vn} of V such that each Vi is a global dominating set. The author obtains several easy bounds for these parameters. The paper is marred by a vast number of printing errors, particularly omissions of mathematical symbols.