TY - JOUR
T1 - Vertex-magic total labelings of union of generalized Petersen graphs and union of special circulant graphs
AU - Silaban, Denny Riama
AU - Parestu, Andrea
AU - Herawati, Bong N.
AU - Ariyanti, Kiki
AU - Slamin,
PY - 2009/11
Y1 - 2009/11
N2 - Let G be a graph with vertex set V = V(G) and edge set E = E(G), and let n = \V(G)\ and e = \E(G)\. A vertex-magic total labeling (VMTL) of a graph is defined as a one-to-one mapping taking the vertices and edges onto the set of integers {1,2,..., n + e}, with the property that the sum of the label on a vertex and the labels on its incident edges is a constant independent of the choice of vertex. In this paper, we present the vertex magic total labeling of disjoint union of t generalized Petersen graphs Uj=1 tP(nj,mj), and disjoint union of t special circulant graphs Uj=1tCn(1,mj).
AB - Let G be a graph with vertex set V = V(G) and edge set E = E(G), and let n = \V(G)\ and e = \E(G)\. A vertex-magic total labeling (VMTL) of a graph is defined as a one-to-one mapping taking the vertices and edges onto the set of integers {1,2,..., n + e}, with the property that the sum of the label on a vertex and the labels on its incident edges is a constant independent of the choice of vertex. In this paper, we present the vertex magic total labeling of disjoint union of t generalized Petersen graphs Uj=1 tP(nj,mj), and disjoint union of t special circulant graphs Uj=1tCn(1,mj).
KW - Circulant graph
KW - Generalized petersen graph
KW - Regular graph
KW - Vertex magic total labeling
UR - http://www.scopus.com/inward/record.url?scp=78651584230&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:78651584230
VL - 71
SP - 201
EP - 207
JO - Journal of Combinatorial Mathematics and Combinatorial Computing
JF - Journal of Combinatorial Mathematics and Combinatorial Computing
SN - 0835-3026
ER -