A graph G is said to be \(\mathcal {C}\) -perfect if, for all induced subgraphs H of G, the induced cycle independence number is equal to its corresponding induce cycle covering number, where every vertex in H belongs to at least one cycle in H. This article deals with the study on \(\mathcal {C}\) -perfection of modular product of graphs. Through this article, we study various structural properties of \(\mathcal {C}\) -perfect modular product of graphs and also characterize them.