In this paper, we define domination in fuzzy graph using strong arcs. Let

be a fuzzy graph with node set V. Let u and v be any two nodes of G. We say that u dominates v if

is a strong arc. A subset D of V is called a dominating set of G if for every

there exists

such that u dominates v. A dominating set D is called a minimal dominating set if no proper subset of D is a dominating set. The smallest number of nodes in any dominating set of

is called its domination number and is denoted by

We discuss some properties of dominating set and find domination number for some standard graphs. We also give some bounds for

fuzzy graph, strong arcs, fuzzy independent set, dominating set, domination number.