Super Mean Labeling is one the interesting topic in graph theory. There also are search that has proved that the super mean labeling is not possible forth the star graphs. In this paper, we generalized the concept of super mean labeling on two star graphs and develop a technique of coding a secret messages using two star graph through super mean labeling. Two types of coding, picture and matrix coding have been illustrated by using different types of numbering of alphabets and algorithm is established.