TY - JOUR

T1 - Super (a, d)-vertex antimagic total labeling on a disjoint union of regular graphs

AU - Ariyanti, Kiki

AU - Silaban, Denny Riama

PY - 2009/11/1

Y1 - 2009/11/1

N2 - Let G = (V, E) be a graph with order \G\ and size \E\. An (a, d.)-vertex-antimagic total labeling is a bijection α from a set of all vertices and edges to the set of consecutive integers {1,2, ...,|V| + such that the weights of the vertices form an arithmetic progression with the initial term a and the common difference d. If a(V(G)) = {1,2,..., |V|} then we call the labeling super (a,d)-vertex antimagic total. In this paper we show some basic properties of such labelings on a disjoint union of regular graphs and show how to construct such labelings for some classes of graphs, such as cycles, generalised Pertersen graphs and circulant graphs, for d = 1.

AB - Let G = (V, E) be a graph with order \G\ and size \E\. An (a, d.)-vertex-antimagic total labeling is a bijection α from a set of all vertices and edges to the set of consecutive integers {1,2, ...,|V| + such that the weights of the vertices form an arithmetic progression with the initial term a and the common difference d. If a(V(G)) = {1,2,..., |V|} then we call the labeling super (a,d)-vertex antimagic total. In this paper we show some basic properties of such labelings on a disjoint union of regular graphs and show how to construct such labelings for some classes of graphs, such as cycles, generalised Pertersen graphs and circulant graphs, for d = 1.

UR - http://www.scopus.com/inward/record.url?scp=78651594495&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:78651594495

VL - 71

SP - 217

EP - 225

JO - Journal of Combinatorial Mathematics and Combinatorial Computing

JF - Journal of Combinatorial Mathematics and Combinatorial Computing

SN - 0835-3026

ER -