The Development of Kriptosistem Polyalphabetic Cipher with Total Antimagic Edges Labeling on Tribune Graph

Muhlisatul Mahmudah

Authors

Muhlisatul Mahmudah Universitas Islam Jember, Indonesia

Abstract

A graph G of order p and size q is an called an (a,d)-edge antimagic total if there exist a bijection f:(V(G)E(G))? {1,2,...,p+q} such that the edge-weights, w(uv) =f(u)+f(v)+f(uv); ; uv,(G) form an arithmetic sequence with ¯first term a and common diference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we will study a super edge-antimagic total Tribun Graph and the application of developing of polyalphabetic cryptosystem. The result shows that connected Tribun Graph admits a super (a; d)-edge antimagic total labeling for d = 0,1,2, and it can be used to develop a secure polyalphabetic cryptosystem.

Keywords: Super (a; d)-edge-antimagic total labeling, Tribun graph

polyalphabetic cryptosystem.

References

Dafik. 2007. Structural Properties and Labeling of Graph.Australia: Tidak dipublikasikan (Tesis).

K.A. Sugeng, M.Miller and M.Ba•ca, Super edge-antimagic total labelings, Utilitas Math.,71 (2006) 131-141.

K.A. Sugeng, M.Miller,Slamin and M.Baca, (a, d)-edge-antimgic total labelings of caterpillars, Lecture Notes in Computer Science, 3330 (2005) 169-180

M. Baca, Antoni Muntaner-Batle, Andrea Semanecova Fenovcikova, On super (a,2)- edge-antimagic total labeling of disconnected Graphs, Ars Combinatoria,113(2014) 129-137

M. Baca, Dafik, M.Miller and J.Ryan, On super (a,d)-edge-antimagic total labeling,J.Combin. Math.Combin. Comput., 65 (2008),61-70.

M. Baca,Yuqing Lin, Andrea Semanecova Fenovcikova, 2009, Note On Super An- timagicness of Disconnected Graphs,AKCE International J.of Graphs and Combinatorics, 6(1), 47-55

Menezes,A., Ooschot,P.V., dan Vanstone. 1996. Handbook of Applied Cryptography. CRC Press:Boca Raton.

Mirka Miller, Oudone Phanalasy, Joe Ryan, and Leanne Raylands, Note on Antimagic Labeling of Trees, Bulletin of the ICA, 72 (2014) 94-100.

R.Simanjuntak, F.Bertault and M.Miller, Two new (a,d)-antimagic graph labeling, Proc. of Eleventh Australasian Workshop on Combinatorial Algorithms,(2000), 179-189