Even Arbitrary Supersubdivision of Corona Related MMD Graphs

Abstract

A graph $G(v,E)$ with $n$ vertices is said to have modular multiplicative divisor bijection $f:V(G)\to 1,2,..,n$ and the induced function $f\ast :E(G)\to 0,1,2,\dots ,n–1$ where $f\ast (uv)=f(u)f(v)(modn)$ 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.