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.
P_m?3K_1,P_m?4K_1, Ladder graph, k-PL(Prime Labeling)
IRE Journals:
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
IEEE:
Mehul Chaurasiya , Anurag Limda , Nishaba Parmar , Mehul Rupani
"Note On k-Prime Labeling of Some Graphs" Iconic Research And Engineering Journals, 4(12)