Global domination in Fuzzy graphs using Strong arcs

Sambathkumar introduces the notion of global domination in graphs. According to him, a dominating set S of G is a global dominating set of G if S is also a dominating set of the complement of G.Nagoorgani and Jahir Hussain introduced the concept of global domination infuzzy graphs using effective arcs. This paper presents global domination infuzzy graphs using strong arcs. The strong global domination number of different classes of fuzzy graphs is obtained. An upper bound for the strong globaldomination number of fuzzy graphs is obtained. Strong global domination infuzzy trees is studied. It is established that every node of a strong global dominating set of a fuzzy tree is either a fuzzy cut node or a fuzzy end node. Itis proved that in a fuzzy tree each node of a strong global dominating set isincident on a fuzzy bridge. Also, the characteristic properties of the existenceof a strong global dominating set for a fuzzy graph and its complement areestablished