Author(s): Sathish T, Reshma S P

Abstract: A [1, 2] – dominating set S of a graph G = {V, E} is an accurate [1, 2] – dominating set, if V – S has no dominating set of cardinality |S|. An accurate [1, 2] – dominating set S of graph G is a global accurate [1, 2] – dominating set, if S is also an accurate dominating set of . The minimum cardinality of a global accurate [1, 2] – dominating set is called the global accurate [1, 2] – domination number and is denoted by . In this paper, we study some bounds for are obtained and exact values of for some standard graphs are found.