Open Access
Research Article·pp. 2199–2210·Vol. 29, Issue 6Jun 2026
Interpreting the corona domination number for the generalized Mycielskian graph of square and cube of some graphs
L. Praveenkumar, G. Mahadevan, C. Sivagnanam
Published Online: 16 Jun 2026DOI: 10.47974/JDMSC-2391
In this paper: 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) =...
