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 find the accurate domination number. 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|. Also we have modified folydwarshall’s Algorithm to fuzzy domination digraphs for finding an accurate dominating set.