Advertisement

Computing Narayana Prime Cordial Labeling of Web Graphs and Flower Graphs

  • B. J. BalamuruganEmail author
  • K. Thirusangu
  • B. J. Murali
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 904)

Abstract

The process of assigning the binary numbers 0 and 1 to the edges of a graph \(G = (V, E)\) through evaluating functions defined on the vertex set V and the edge set E of G using the concepts of prime and Narayana numbers by satisfying cordiality on the edges. This process on the graph G is known as Narayana prime cordial labeling of G and this graph G is called Narayana prime cordial graph. In this article, we compute the Narayana prime cordial labeling of Web graphs and Flower graphs.

Keywords

Narayana numbers Prime numbers NPC graphs 

References

  1. 1.
    Acharya, B.D., Hegde, S.M.: Arithmetic graphs. J. Graph Theory. 14(3), 275–299 (1990)Google Scholar
  2. 2.
    Rosa, A.: On certain valuations of the vertices of a graph. In: Theory of graphs (Internat. Sympos. Rome: 349–359 (1967) Gordan and Breach. Newyork. Dunod, Paris (1966)Google Scholar
  3. 3.
    Lakshmi Prasana, N., Saravanthi, K., Sudhakar, N.: Applications of graph labeling in major areas of computer science. Int. J. Res. Comput. Commun. Technol. 3(8) (2014)Google Scholar
  4. 4.
    Gallian, J.A.: A Dynamic Survey of Graph Labeling. Electron. J. Comb. 17 (DS6) (2016)Google Scholar
  5. 5.
    Harary, F.: Graph Theory. Addison-Wesley, Reading Mass (1972)zbMATHGoogle Scholar
  6. 6.
    Bona, M., Sagan, B.E.: On divisibility of Narayana numbers by primes. J. Integer Sequences. 8 (2005)Google Scholar
  7. 7.
    Murali, B.J., Thirusangu, K., Balamurugan, B.J.: Narayana prime cordial labeling of graphs. Int. J. Pure Appl. Math. 117(13), 1–8 (2017)Google Scholar
  8. 8.
    Miller, Mirka, Phanalasy, Oudone, Ryan, Joe: Antimagicness of some families of generalized graphs. Australas. J. Comb. 53, 179–190 (2012)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Cahit, I.: Cordial graphs: a weaker version of graceful and harmonics graphs. Ars Combin. 23, 201–207 (1987)MathSciNetzbMATHGoogle Scholar
  10. 10.
    Ho, Y.S., Lee, S.M., Shee, S.C.: Cordial labelings of unicylic graphs and generalized Petersen graphs. Congr. Number. 68, 109–122 (1989)Google Scholar
  11. 11.
    Vaidhya, Samir K., Shah, Nirav H.: Prime cordial labeling of some graphs. Open J. Discrete Mathe. 2(1), 11–16 (2012)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Yousef, M.Z.: Graph operations and cordiality. Ars Combin. 97, 161–174 (2010)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Koshy, T.: Catalan Numbers with Applications. Oxford University Press (2009)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  • B. J. Balamurugan
    • 1
    Email author
  • K. Thirusangu
    • 2
  • B. J. Murali
    • 3
  1. 1.School of Advanced SciencesVIT UniversityChennaiIndia
  2. 2.Department of MathematicsSIVET CollegeChennaiIndia
  3. 3.Research and Development CentreBharathiar UniversityCoimbatoreIndia

Personalised recommendations