MMD labeling of $W_{5}$ corona with 2m copies of $W_{5}$

Consider a graph
$\hat{\mathrm{G}}$
consisting of
$\check{\mathrm{r}}$
nodes and a relation ƍ from the set of nodes of
$\hat{\mathrm{G}}$
to {1,2, …, ř} so that ƍ satisfies one to one and onto condition. Define an edge weight as ƍ (c) ƍ (d)(mod ř) for any edge cd in
$\hat{\mathrm{G}}$
. A graph
$\hat{\mathrm{G}}$
is a modular multiplicative divisor (MMD) graph if the sum of all edge weights of
$\hat{\mathrm{G}}$
is a multiple of
$\check{\mathrm{r}}$
. Examine here the role of MMD labeling in the contexture of corona product of wheel W
5
and 2m copies of wheel graph W
5
.