Distance Magic Labeling of Mollusc Graph

A Distance magic labeling of a graph G = (V, E) of order n is a bijection f : V (G) → {1, 2, . . . , n} such that ∑(u?N(v)?f (u) = k, for all v ∈ V (G) where N (v) is the set of all vertices which are adjacent to v, called neighbourhood of the vertex v ∈ V (G). The constant k is called magic constant of the distance magic labeling f. A graph which admits distance magic labeling is called Distance magic graph. In this paper we have considered the simple, finite, undirected graphs and discussed few theorems on Distance magic labeling of Mollusc Graph and disjoint union of Mollusc graph and Multipetal graph.