Minggu, 29 Juni 2014 - 22:05:46 WIB
Super Edge-Antimagic Total Labeling of Disjoint Union of Triangular Ladder and Lobster Graphs
Dafik, Slamin, Riris Raty R, M. Fuad, Proceeding of IndoMS International Conference on Mathematics and Its Applications (IICMA), (2009) 595-604


Abstract: A graph G of order p and size q is called an (a, d)-edge-antimagic total if there exist a bijection f from V (G) U E(G) to the set of consecutive integers {1, 2, . . . , p + q}such that the edge-weights, W(uv) = f(u) + f(v) + f(uv); uv in E(G), form an arithmetic sequence with first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we study super (a; d)-edge- antimagic total properties of disconnected graphs triangular ladder and lobster.

Key Words:(a; d)-edge-antimagic total labeling, super (a; d)-edge-antimagic total labeling, triangular ladder, lobster graph.

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