Corona domination number is defined as, if each vertex in the graph induced by a dominating set. 𝒟 satisfies the condition that either d(u) = 1 or there exist v ∈ 𝒟 such that u ∈ N(v), and d⟨𝒟⟩ (v) = 1, then such a dominating set is called a corona dominating set (CDS), and its smallest size is referred to as the corona domination number (CD-number), denoted by γCD. In this article, the CD-number for the generalized Mycielskian graph of square and cube of some graphs was computed. Also, the CD-numbers were given explicitly instead of giving their bounds. The γCD number for the graphs considered in this article is identified using some number theory techniques.