Prime labeling in the context of subdivision of some cycle related graphs

Abstract

A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set of first n positive integers such that any two adjacent vertices in G have relatively prime labels. The results about prime labeling of wheel, helm, flower, crown and union of crown graphs are very well-known. In this paper we obtain prime labeling of various graphs resulting from the subdivision of edges in these graphs.