Prime Labeling of Special Graphs

References

[1] S. Sakthivel, and T. R. Karpagam, Prime Labeling of Some New Standard Graphs,| Peripex-Indian Journal of Research, vol. 6, no. 2, pp. 343-345, 2017.

[2] S. Meena, and P. Kavitha, Some new results on prime graphs,| International Journal of Mathematics and Computer Science, vol. 3, no. 1, pp. 837-849, 2015.

[3] S. K. Vaidya, and U. M. Prajapati, Some New Results on Prime Graphs,| Open Journal of Discrete Mathematics, vol. 2, pp. 99-104, 2012.

[4] A. H. Berliner, N. Dean, J. Hook, A. Marr, A. Mbikika, and C. D. McBee, Coprime and Prime Labeling of Graphs,| Journal of Integer Sequence, Vol. 19 , no. 2, 2016.

[5] S. Ashokkumar, and S. Maragathavalli, Prime Labeling of Some Special Graphs,| ISOR Journal of Mathematics, vol. 11, no. 1, pp. 01-05, 2015.

[6] T.R.D.S.M. Thennakoon, M.D.M.C.P. Weerarathna and A.A.I. Perera, Prime Labeling of Newly Constructed Graph Using Star Graphs and Complete Bipartite Graphs,| Sumerianz Journal of Scientific Research, vol. 3, no. 2, pp. 10-17, 2020.

[7] D. M. T. B. Dissanayake, R. A. S. T. Abeysekara K. D. E. Dhananjaya, A. A. I. Perera and P. G. R. S. Ranasinghe, Prime Labeling of Complete Tripartite Graphs of the Form ,| Elixir International Journal, 130, pp. 53092-53094, 2019.

[8] R. J. Wilson, Introduction to Graph Theory, 4th ed., Malaysia: Longman, 1996, Ch. 2.

[9] J. L. Gross, J. Yellen, and P. Zhang, HandBook Of Graph Theory, 2nd ed., CRC Press, 2014, Ch. 5.

[10] R. Tout, A. N. Dabbouchy, K. Howalla, Prime labeling of graphs,| national Academy of Science Letters-India, vol. 5, no. 11, pp. 365-368, 1982.

@article{1702358,
      author = {M. D. M. C. P. Weerarathna, T. R. D. S. M. Thennakoon, A. C. G. Perera},
      title = {Prime Labeling of Special Graphs},
      journal = {Iconic Research And Engineering Journals},
      year = {2020},
      volume = {3},
      number = {12},
      pages = {84-86},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1702358.pdf},
      abstract = {In this paper we investigate the prime labeling of newly constructed graphs. The symbols V(G) and E(G) will denote the vertex set and edge set of a graph G.  A graph G=(V(G),E(G) )with |V(G)| vertices is said to have prime labeling if there exist a bijection mapf?V(G) ? {1,2,3,?,|V(G)|} such that for each edge e=uv  in E(G),f(u) and f (v) are relatively prime. Two integers are said to be relatively prime, if their greatest common divisor(gcd) is 1. We proved that the graphs obtained by replacing every edge of a star graph K1,n by C_m is a prime graph, where n ? 1 and m?4.},
      keywords = {Prime labeling, Prime graphs, Greatest common divisor, Star Graphs, Cyclic Graphs},
      month = {June},
  }