@article{Mahmudah_2017, title={The Development of Kriptosistem Polyalphabetic Cipher with Total Antimagic Edges Labeling on Tribune Graph}, volume={2}, url={https://ejurnal.uij.ac.id/index.php/AXI/article/view/298}, abstractNote={<p class="Textbody"><em>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.</em></p> <p class="IndexTerms"><em>Keywords:</em><em>  </em><em>Super </em>(<em>a; d</em>)<em>-edge-antimagic total labeling, </em><em>Tribun</em><em> graph </em></p> <p class="IndexTerms"><em>polyalpha</em><em>betic cryptosystem</em><em>.</em></p>}, number={2}, journal={Jurnal Axioma : Jurnal Matematika dan Pembelajaran}, author={Mahmudah, Muhlisatul}, year={2017}, month={Jul.}, pages={157–165} }