Note On k-Prime Labeling of Some Graphs

References

[1] J.A. Gallian, A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatories, (2019), DS6.

[2] F. Harary, Graph theory, Narosa Publication House Reading, New Delhi, 1988

[3] Akilandeswari. k, Tamilselvi. M., “On k-Heronian Mean Labeling”, International Journal of Innovative Research in Science, Engineering and Technology, Vol. 6, Issue 9 ,2017, PP-18019-18023

[4] Tamilselvi .M, Akilandeswari. k, “k-Heronian Mean Labeling of Triangular and Quadrilateral snake Graphs”, International Journal of Scientific Research and Review, Vol. 7, Issue 6, 2018, PP-44-50

[5] A. Tount, A. N. Dabboucy and K. Howalla, Prime labeling of graphs, Nat. Acad. Sci. Latters, 11(1982), 365-368.

[6] S. Teresa Arockiamary and G. Vijayalakshmi, “Prime labeling of certain cycle connected graphs”, Malaya journal of Mathematic, Vol.1,2019, PP-280-283.

[7] S. K. Vaidya and U. M. Prajapati, “some results om Prime and -prime labeling”, Journals Of mathematics Research 3(1) (2011).

@article{1702749,
      author = {Mehul Chaurasiya, Anurag Limda, Nishaba Parmar, Mehul Rupani},
      title = {Note On k-Prime Labeling of Some Graphs},
      journal = {Iconic Research And Engineering Journals},
      year = {2021},
      volume = {4},
      number = {12},
      pages = {9-11},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1702749.pdf},
      abstract = {A k-PL of a graph G=(V,E) is an injective functionf:V(G)?{k,k+1,?,k+|V|-1};k?2, a function f^+:E(G)?Nevery edges of G which induced  by f^+ (pq)=gcd?(f(p)f(q) ),?e=pq?E(G) such that gcd?(f(p)f(q) )=1. A graph G=(V,E) admits a k-PL which is called a k-prime graph. In this paper we investigateP_m?3K_1,P_m?4K_1,Ladder graph anda Quadrilateral snake graphs which admit k-PL.},
      keywords = {P_m?3K_1,P_m?4K_1, Ladder graph, k-PL(Prime Labeling)},
      month = {June},
  }