A graph \(G(v,E)\) with \(n\) vertices is said to have modular multiplicative divisor bijection \(f: V(G)→{1,2,.., n}\) and the induced function \(f*: E(G) → {0,1,2,…, n – 1}\) where \(f*(uv)=f(u)f(v)(mod\,\,n)\) for all \(uv \in E(G)\) such that \(n\) divides the sum of all edge labels of \(G\). This paper studies MMD labeling of an even arbitrary supersubdivision (EASS) of corona related graphs.