International Peer-Reviewed JournalOpen AccessISSN 2456-8880
irejournals@gmail.com+91-7433024337

Home / Current Issue / Paper 1702749

1702749PublishedVol 4 · Issue 12

Note On k-Prime Labeling of Some Graphs

Mehul Chaurasiya Anurag Limda Nishaba Parmar Mehul Rupani

Subject area: Science,Engineering and Technology  ·  Area of research: Mathematics (Graph Theory)

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)

How to cite this paper

Mehul Chaurasiya, Anurag Limda, Nishaba Parmar, Mehul Rupani "Note On k-Prime Labeling of Some Graphs" Iconic Research And Engineering Journals Volume 4 Issue 12 2021 Page 9-11
Mehul Chaurasiya, Anurag Limda, Nishaba Parmar, Mehul Rupani "Note On k-Prime Labeling of Some Graphs" Iconic Research And Engineering Journals, vol. 4, no. 12, Jul. 2021
Mehul Chaurasiya, Anurag Limda, Nishaba Parmar, Mehul Rupani (2021). Note On k-Prime Labeling of Some Graphs. Iconic Research And Engineering Journals, 4(12).
Mehul Chaurasiya, Anurag Limda, Nishaba Parmar, Mehul Rupani "Note On k-Prime Labeling of Some Graphs" Iconic Research And Engineering Journals, vol. 4, no. 12, Jul. 2021.
@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},
  }