A Family of Join Spider Graphs on Sum Divisor Cordial Labeling with Application

A graph G with p vertices and q edges is said to be a Sum Divisor Cordial labelling. If ????: ???? → 1,2, … ???? such that for each edge ???????????????? assign the label 1, if 2|(???? ???? + ????(????)| and 0 otherwise, satisfying the condition |e????(1)- e???? 0 | ≤ 1, where e????(1) is the number of edges labelled with 1 and e????(0) is the number of edges labelled with 0. A graph with a sum divisor cordial labeling graph. In this paper we study and we prove that for a class of Join Spider graphs with atmost one additional leg namely JSP(1m,2n), JSP(1m,2n,32), JSP(1m,2n,42), JSP(1m,2n,52). In this paper we identify an application using Affline Cipher for Cyber Security through encryption and decryption.