Coding Through a Two Star and Super Mean Labeling
In this paper, a technique of coding a message is presented using the super mean labeling on a two star graph K1,m ∪ K1,n, m ≤ n. A method of fixing the super mean labeling on any two star graph is provided after stating a few observations for a super mean labeling on a two star graph in order to use the combination of the two for coding.
- 1.P. Jeyanthi, D. Ramya and P. Thangavelu, On super mean graphs, AKCE Int.J.Graphs.combin., 6(1), (2009),103–112.Google Scholar
- 2.R.Ponraj and D.Ramya, on super mean graphs of order 5, Bulletin of pure and Applied sciences, (section E Maths and Statistics)., 25E (2006),143–148.Google Scholar
- 3.D. Ramya and P. Jeyanthi, Super mean labeling of some classes of graphs, International J.Math.combin.,1(2012), 83–91.Google Scholar
- 4.R.C Read, Graph Theory and the Amateur Cryptogapher Computer Math Applic., 34(11), 1997, 121–127.Google Scholar