Abstract: The medium domination number of a Jahangir graph Jm,n was introduced by M. Ramachandran and N. Parvathi. Recently Mahadevan et al., introduced the concept of extended medium domination number of a graph. edom (u, v) is the sum of number of u-v paths of length less than or equal to 3. ETDV (G) = Σedom (u, v) for u, vεV(G) is the total number of vertices that dominate every pair of vertices. The extended medium domination number of G is EMD(G) = ETDV(G)/(p2) where, p is the number of vertices in G. Here, we generalize the extended medium domination number of Jahangir graph, sunflower graph and windmill graph.