A graph in which vertices are labeled with first p natural numbers, where p is the number of vertices of the graph and the edges are labeled with one plus product of the labels of the incident vertices is said to admit one raised product prime labeling, if the greatest incidence number of each vertex of degree one is one.

Keywords : Graph Labeling, Product, Prime Labeling, Prime Graph, Tree.