TY - JOUR

T1 - Vertex-antimagic total labeling of the union of suns

AU - Parestu, Andrea

AU - Silaban, Denny Riama

AU - Ariyanti, Kiki

PY - 2009/11/1

Y1 - 2009/11/1

N2 - Let G = (V, E) be a graph with V(G) as a set of vertices and E(G) as a set of edges, where n = |V(G)| and e = |-E(G)|. A graph G = (V, E) is said to be (a, d)-vertex antimagic total if there exist positive integers a, d and a bijection A from V(G) U E(G) to the set of consecutive integers {1,2,...,n+e] such that the weight of vertices form arithmetical progression with initial term a and common difference d. In this paper we will give (a, d)-vertex antimagic total labeling of disconnected graph, which consists of the union of t suns for d ∈ {1,2,3,4,6}.

AB - Let G = (V, E) be a graph with V(G) as a set of vertices and E(G) as a set of edges, where n = |V(G)| and e = |-E(G)|. A graph G = (V, E) is said to be (a, d)-vertex antimagic total if there exist positive integers a, d and a bijection A from V(G) U E(G) to the set of consecutive integers {1,2,...,n+e] such that the weight of vertices form arithmetical progression with initial term a and common difference d. In this paper we will give (a, d)-vertex antimagic total labeling of disconnected graph, which consists of the union of t suns for d ∈ {1,2,3,4,6}.

KW - Sun graph

KW - Vertex antimagic total labeling

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

M3 - Article

AN - SCOPUS:78651553233

VL - 71

SP - 179

EP - 188

JO - Journal of Combinatorial Mathematics and Combinatorial Computing

JF - Journal of Combinatorial Mathematics and Combinatorial Computing

SN - 0835-3026

ER -