On MOD(k) Vertex Magic Labeling of Graphs

Abstract

A (p, q) graph G with p vertices and q edges is mod(k)vertex magic if for any integer k≥2, lɛZk and there exists a one-to-one map f from V(G) to and such that for each edge e, the sum of the labels of the vertices adjacent with e are all equal to the same constant modulo k. In this paper, we introduce a new type of labeling namely mod(k) vertex magic labeling of a graph and we prove some classes of graphs are mod(k)vertex magic.