Vol. 3, Issue 11, Part D (2017)

Abstract

Let G= (V,E) be a finite, simple and undirected graph. A Graph G is a one to one λ from EUV onto the set of consecutive integers {1, 2,.. e+v} is called edge magic total or vertex magic total labeling if all the edge weights or vertex weights are equal to a constant, respectively. A Graph G is called edge antimagic total or vertex antimagic total labeling if edge weights or vertex weights are different, respectively. In this paper, we provide some classes of graphs that are simultaneously super edge magic total and super vertex antimagic total labeling and also simultaneously super vertex magic total and super edge antimagic total labeling. We show several results for some classes of Cycle graph are simultaneously super vertex magic total and super edge antimagic total labeling and some classes of kite, sun, prism, paw, cricket graphs are simultaneously super edge magic total and super vertex antimagic total labeling.