LET G BE A SIMPLE GRAPH OF ORDER N. THE DOMINATION POLYNOMIAL OF G IS THE POLYNOMIAL (FORMULA) XI, WHERE D (G, I) IS THE NUMBER OF DOMINATING SETS OF G OF SIZE I. LET N AND Q³3 BE ANY POSITIVE INTEGER AND FQ,N BE THE GENERALIZED FRIENDSHIP GRAPH FORMED BY A COLLECTION OF N CYCLES (ALL OF ORDER Q), MEETING AT A COMMON VERTEX. WE STUDY THE DOMINATION POLYNOMIALS OF SOME GENERALIZED FRIENDSHIP GRAPHS. IN PARTICULAR WE EXAMINE THE DOMINATION ROOTS OF THESE FAMILIES, AND FIND THE LIMITING CURVE FOR THE ROOTS.