Super vertex-magic total labelings of some graphs

Abstract

et G be a graph with v vertices and e edges. A super vertex-magic total labeling of G is a bijection from to with the property that for every vertex x in, the sum is a constant and. We collect and present graphs that admit super vertex-magic total labeling such as certain families of circulant graphs where and where and where where, n is odd. also some graphs that do not admit any super vertex-magic total labeling such as prism graph, book graph and crown graph are shown. Moreover, we show a method to obtain super vertex-magic total labeling of the disjoint union of k copies of a graph G, for a large number of values of k, from the graph G with some characteristics which admits a super vertex-magic total labeling.