Open AccessMatrix Coding Technique on Sunflower Graphs with Edge Product Cordial Labeling
Author(s) -
G. Prasad,
G. Uma Maheswari
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/872/1/012004
Subject(s) - coding (social sciences) , computer science , vertex (graph theory) , combinatorics , graph labeling , theoretical computer science , sunflower , algorithm , graph , mathematics , line graph , statistics , graph power
In this paper we develop a technique of coding a secret messages using Sun Flower graphs SF n by subdividing edges and 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 label 0 and 1 differ by atmost 1. Here, we discuss edge product cordial labeling for sunflower graphs subdivided edges and developed a coding technique of transforming plain text (Text message) in to Cipher Text (Matrix code) and established algorithm. By recent development in coding theory involving programming concepts in any computer languages, this article will revisit without programming method, the matrix coding technique is developed.