SECRET CODING TECHNIQUE ON SUNFLOWER GRAPHS WITH PRODUCT CORDIAL LABELING

In this paper, we develop a technique of coding secret messages using sunflower graphs SFn by applying edge product cordial labeling. The induced vertex labeling function defined by the product of labels of incident edges to each vertex is such that the number of edges with labels 0 and 1 differ by at most 1. The roles of vertices and edges are interchanged in product cordial labeling. Here, we discuss edge product cordial labeling for sunflower graphs and developed a coding technique, transforming plain text (text message) into Cipher text (matrix code) and established algorithm. By recent development in coding theory involving programming concepts in any computer languages, this article revisits without programming method, the matrix coding technique.