Accurate Domination in Fuzzy Digraphs using Strong Arc

Abstract

In this paper, we introduce the concept of accurate dominating set in fuzzy digraphs using strong arc and also an accurate domination number of a fuzzy digraph. In a fuzzy digraph, a subset D of V is an accurate fuzzy dominating set of a fuzzy digraph if every node σD(v) Є V-D is not dominated by atleast one node    σD(u) Є D with same cardinality |D|. The accurate domination number of a fuzzy digraph is the minimum cardinality of an accurate dominating set which is denoted by γfa(GD).The upper domination number Γfa(GD) is the maximum cardinality of an accurate dominating set. We prove some results on accurate dominating set of a fuzzy digraph. Also we have modified folyd warshall’s Algorithm to fuzzy domination digraphs for finding an accurate dominating set.