Skip to main content

Coding Through a Two Star and Super Mean Labeling

  • Conference paper
  • First Online:
Applied Mathematics and Scientific Computing

Part of the book series: Trends in Mathematics ((TM))

Abstract

In this paper, a technique of coding a message is presented using the super mean labeling on a two star graph K 1,m ∪ K 1,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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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 

  5. Saverio Caminiti, Irene Finocchi and Rosella peterschi, On coding labeled trees, Theoretical computer science., 382(2007)97–108.

    Article  MathSciNet  Google Scholar 

  6. R.Vasuki and A.Nagarajan, Some results on super mean graphs, International Journal of Mathematical Combinatorics., 3 (2009), 82–96.

    MathSciNet  MATH  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. Balaji .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Uma Maheswari, G., Margaret Joan Jebarani, G., Balaji, V. (2019). Coding Through a Two Star and Super Mean Labeling. In: Rushi Kumar, B., Sivaraj, R., Prasad, B., Nalliah, M., Reddy, A. (eds) Applied Mathematics and Scientific Computing. Trends in Mathematics. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-01123-9_46

Download citation

Publish with us

Policies and ethics