Detour Global Domination Number of Some Standard And Special Graphs

Abstract

       In this paper, we introduce a new domination parameter, called detour global domination number of a graph. A subset S of V of a connected graph G is a detour global dominating set if S is both detour set and global dominating set of G. The minimum cardinality taken over all detour global dominating sets is called the detour global domination number of G and is denoted by (G). A detour global dominating set of cardinality  (G) is called a - set of G. We determine (G) for some standard and special graphs and study some general properties for