Square sum difference product prime labeling of some cycle related graphs

Square sum difference product prime labeling of a graph is the labeling of the vertices with {0,1,2---------,p-1} and the edges with absolute difference of the sum of the squares of the labels of the incident vertices and product of the labels of the incident vertices. The greatest common incidence number of a vertex (gcin) of degree greater than one is defined as the greatest common divisor of the labels of the incident edges. If the gcin of each vertex of degree greater than one is one, then the graph admits square sum difference product prime labeling. In this paper we investigate some cycle related graphs for square sum difference product prime labeling.