Generation of prime graphs using someunary graph products on star 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 sub division and shadow of star graphs preserve prime labeling.Mathematics Subject Classification:
05C78;05C05 Keywords: prime labeling; prime graphs; unary product of graphs;