Coding Through a Two Star and Super Mean Labeling

  • G. Uma Maheswari
  • G. Margaret Joan Jebarani
  • V. BalajiEmail author
Conference paper
Part of the Trends in Mathematics book series (TM)


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. 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. 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. 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. 4.
    R.C Read, Graph Theory and the Amateur Cryptogapher Computer Math Applic., 34(11), 1997, 121–127.Google Scholar
  5. 5.
    Saverio Caminiti, Irene Finocchi and Rosella peterschi, On coding labeled trees, Theoretical computer science., 382(2007)97–108.MathSciNetCrossRefGoogle Scholar
  6. 6.
    R.Vasuki and A.Nagarajan, Some results on super mean graphs, International Journal of Mathematical Combinatorics., 3 (2009), 82–96.MathSciNetzbMATHGoogle Scholar
  7. 7.
    R.Vasuki and A. Nagarajan, On the construction of new classes of super mean graphs, Journal of Discrete Mathematical Sciences and Cryptography.,13 (3),(2010), 277–290.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • G. Uma Maheswari
    • 1
  • G. Margaret Joan Jebarani
    • 2
  • V. Balaji
    • 1
    Email author
  1. 1.Department of MathematicsSacred Heart CollegeTirupatturIndia
  2. 2.Department of MathematicsAuxilium CollegeVelloreIndia

Personalised recommendations