Modular Multiplicative Divisor Labeling of k-Multilevel Corona Related Graphs

Abstract

A graph G(V, E) with n vertices is said to have modular multiplicative divisor labeling if there exist a 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 ∈ E(G) such that n divides the sum of all edge labels of G. In this paper we discuss new results on modular multiplicative divisor (abbreviated as MMD) labeling of k-multilevel corona of path P3 with disjoint union of 2m copies of k1 and k-multilevel corona of Cn+ (adding pendant edge for each vertex of the cycle Cn) with disjoint union of 2m copies of path P3, where k and m are positive integers.