Super (a,d)-edge Antimagic Total Labeling of\\ Shackle ($F_6, B_2, n$) for Developing a Polyalphabetic Cryptosystem
Arnasyitha Yulianti Soelistya, Dafik Dafik, Arif Fatahillah · 2016
A graph G of order p and size q is called an ( a; d )-edge-antimagic total if there exist a bijection f : V ( G ) [ E ( G ) ! f 1 ; 2 ; : : : ; p + qg such that the edge-weights, w ( uv ) = f ( u ) + f ( v ) + f ( uv ) ; uv 2 E ( G ), form an arithmetic sequence with ¯rst term a and common di®erence d . Such a graph is called super if the smallest possible labels appear on the vertices. In this paper we study a super edge-antimagic total labeling of Shackle ( F 6 ; B 2 ; n ) Graph connected and we will use it to develop a polyalphabetic cryptosystem.