Prime Cordial Labelling of Some Fullerene Graphs and Its Coding Applications
N. A. Parmar *
Shree H. N. Shukla College of IT & Mgmt, Saurashtra University, Rajkot, Gujarat, India.
*Author to whom correspondence should be addressed.
Abstract
In this paper prime cordial labeling has been used for encryption and decryption of the message to enhance the secrecy of the messages. For that hybrid approach has been used with plain text encryption by using symmetric encryption techniques such as substitution and transposition cipher techniques. Substitution cipher techniques contains playfair cipher and one time pad (OTP). While in transposition cipher technique contains raw-column transposition method and also, GMJ coding method has been used. By application of graph labeling techniques in cryptography, we proved 24-fullerene and 26-fullerene graphs are prime cordial graphs. Further using prime cordialness of above graphs, encrypted the message using GMJ coding method and hybrid combinations of above discussed methods. All encryption methods have their own limitations like adding buffer words, used same keywords, going with same encryption method hence we combine all methods to restrict their limitations and to enhance the secrecy of messages.
In this research work we performed GMJ coding and hybrid approach subject to graph labeling to protect the message from hackers or third party ensuring secrecy of messages during transmission.
Keywords: Prime cordial labeling, fullerene, GMJ coding, playfair cipher, OTP, raw column transposition