Domination in Fuzzy Directed Graphs

A new domination parameter in a fuzzy digraph is proposed to espouse contribution the domain of graph and directed graph. Let GD*=V,A be simple graph, where V finite nonempty set A=x,y:x,y∈V,x≠y. GD=σD,μD pair two functions σD:V→0,1 μD:A→0,1, such that μDx,y≤σDx∧σDy, x,y∈V. An edge μDx,y called an effective if μDx,y=σDx∧σDy. The vertex σDx dominates σDy GD edge. S⊆V, u∈V\S, v∈S. subset σDS⊆σD dominating if, for every σDu∈σD\σDS, there exists σDv∈σDS, σDv σDu. minimum number denoted by γGD. In this paper, concept introduced, characterized, dipath dicycle modeled.