Publications

Abstract : Let A be an abelian group. An A-vertex magic labeling of a graph G is a mapping from the vertex set of G to the set of all non-identity elements of A if there exists μ in A such that for any vertex v of G, the sum of labels of all the neighbors of v is μ. A graph G is A-vertex magic if G admits such a labeling. Moreover, if G is A-vertex magic for any abelian group A, then G is group vertex magic. In this article, we characterize A-vertex magic trees of diameter at most 5 for any finite abelian group A. We prove that A-vertex magic graphs do not possess any forbidden structures, and finally we give certain techniques to construct larger Avertex magic graphs from the existing ones.