EASS of MMD graphs

Abstract

Modular multiplicative divisor graph G with n vertices is a bijection g from V(G) to {1,2,…, n} and induced function h from edges of G to {0,1,…,n-1}, h(vw)=g(v)g(w) mod n for every vw in edges of G then adding the labels of all the edges is a multiple of n. Here studies MMD labeling of an even arbitrary supersubdivision (EASS) of cycle Cn .