A new domination parameter in a fuzzy digraph is proposed to espouse a contribution in the domain of domination in a fuzzy graph and a directed graph. Let be a directed simple graph, where is a finite nonempty set and . A fuzzy digraph is a pair of two functions and , such that , where . An edge of a fuzzy digraph is called an effective edge if . Let . The vertex dominates in if is an effective edge. Let , , and . A subset is a dominating set of if, for every , there exists , such that dominates . The minimum dominating set of a fuzzy digraph is called the domination number of a fuzzy digraph and is denoted by . In this paper, the concept of domination in a fuzzy digraph is introduced, the domination number of a fuzzy digraph is characterized, and the domination number of a fuzzy dipath and a fuzzy dicycle is modeled.