ON SUPER (3n+5,2)- EDGE ANTIMAGIC TOTAL LABELING AND IT’S APPLICATION TO CONSTRUCT HILL CHIPER ALGORITHM

Graph labeling can be implemented in solving problems for various fields of life.  One of the application of graph labelling is in security system. Information security is needed to reduce risk, data manipulation, and unauthorized destruction or destruction of information. Cryptographic algorithms that can be used to build security systems, one of the cryptographic algorithms is Hill Cipher. Hill chipper is a cryptographic algorithm that uses a matrix as a key to perform encryption, decryption, and modulo arithmetic. This study discusses the use of Super (3n+5,2)- edge antimagic total labeling to construct the Hill Chiper algorithm. The variation of the edge weight function and the corresponding edge label on the  graph, will make the constructed lock more complicated to hac

On Super Edge-Antimagic Total Labeling Of Subdivided Stars

In 1980, Enomoto et al. proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph. In this paper, we give a partial sup- port for the correctness of this conjecture by formulating some super (a, d)- edge-antimagic total labelings on a subclass of subdivided stars denoted by T(n, n + 1, 2n + 1, 4n + 2, n5, n6, . . . , nr) for different values of the edge- antimagic labeling parameter d, where n ≥ 3 is odd, nm = 2m−4(4n+1)+1, r ≥ 5 and 5 ≤ m ≤ r