Generation of prime labeled trees through corona product

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 tree Tn ⊙ K1, for any n admit prime labeling provided with the prime labeling of tree Tn. By the way, we prove that using corona product of tree with complete graph on one vertex, we can generate prime labeled trees. This procedure
can be repeated so that we can generate prime labeled trees as long as the procedure is continued.