A set D ⊂ V of a given fuzzy graph ( )is a dominating set if for every there exists such that ( ) is a strong arc and ( ) ( ) and if the number of vertices of D is minimum then it is called a minimum dominating set of G. Domination number of G is the sum of membership values of vertices ofa minimum dominating set and it is denoted by ( ). In this paper we study domination in fuzzy graphs. Also we formulate an algorithm to find dominating set for a given fuzzy graph.