Minggu, 29 Juni 2014 - 21:34:26 WIB
Antimagic Labeling of Disjoint Union of s-Crowns
Martin Baca ,Dafik, Mirka Miller,and Joe Ryan, Utilitas Mathematica, 79 (2009) 193 - 205
Jurnal Internasional


Abstract: A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges by pairwise distinct integers of 1, 2, . . . , |V (G)| + |E(G)| such that the edge-weights, W(uv) = f(u) + f(v) + f(uv), uv in  E(G), form an arithmetic sequence with the first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. A construction of super (a, d)-edge-antimagic total labelings of some disconnected graphs are described.


Key Words: (a, d)-edge-antimagic total labeling, super (a, d)-edge-antimagic total labeling, s-crowns.

.:: Welcome to Prof. Dafik M.Sc,Ph.D Academic Website ::.