Sum Square Prime Labeling Of Some Tree Graphs

Sum square prime labeling of a graph is the labeling of the vertices with {0,1,2---------,p-1} and the edges with square of the sum 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 sum square prime labeling. Here we identify some tree graphs for sum square prime labeling.