Split And Strong Split Dominations In Intuitionistic Anti-Fuzzy Graphs

Abstract

A dominating set D of an IAFG  is said to be a split dominating set if the induced sub graph  is disconnected. But dominating set D of an intuitionistic anti-fuzzy graph  is a strong split dominating set if the induced intuitionistic anti-fuzzy sub graph of  is totally disconnected. In this paper we defined the notion of split dominating set and strong split dominating set with their domination numbers. The strength of anti-path in IAFG and the strength of anti-connectedness between two vertices of IAFG are examined. Split domination and split domination number in anti-fuzzy structure of intuitionistic fuzzy graphs are discussed and argued some theorems