The Double Global Domination Number of a Graph
Let G=(V, E) be a graph. A double dominating set D of G is a double global dominating set, if D is also a double dominating set of ¯G. The double global domination number γdg(G) of G is the minimum cardinality of a double global dominating set of G. In this paper, a study on this new parameter is initiated.