VERTEX (a; d)-ANTIMAGIC TOTAL LABELING ON CIRCULANT GRAPH Cn(1,2,3)
Abstract: Let G = (V; E) be a
graph with order jGj and size jEj. An (a; d)-vertexantimagic total labeling is
a bijection α from all vertices and edges to the set of consecutive integers
f1; 2; :::; jV j + jEjg, such that the weights of the vertices form an
arithmetic progression with the initial term a and the common difference d. If α(V
(G)) = f1; 2; : : : ; jV jg then we call the labeling a super (a; d)-vertex
antimagic total. In this paper we show how to construct such labelings for
circulant graphs Cn(1; 2; 3), for d = 0; 1; 2; 3; 4; 8.
Author: K.A. Sugeng and N.H.
Bong
Journal Code: jpmatematikagg110010
