In this paper, we determine the edge metric dimension of the comb product of a cycle graph and a simple graph containing a dominant vertex. This result generalizes previous findings on the edge metric dimension of the comb product of a cycle and a complete graph. We show that the edge metric dimension of C n ▷ D , where D is a simple graph with a dominant vertex, equals the product of the order of C n and the order of D reduced by two.