Generation of prime graphs using corona product of cycles and wheels with complete graphs

A graph with vertex set V is said to have a prime labeling if its vertices are labeled with distinct integers 1, 2, 3, . . . , |V
| such that for each edge xy the labels assigned to x and y are relatively prime. In this paper, we prove that
graphs Cn ⊙ K1, for any n ≥ 3 and Wn ⊙ K1 are prime when n is even.
Mathematics Subject Classification: 05C78;05C05
Keywords: prime labeling; prime graphs; corona product of graphs;