Let G(V,E) be a graph with p vertices and q edges. Let f:V(G)→{0,1,2,…,p-1} be a bijection. Define f^*:E(G)→N by f_sqdp^* (uv)=|(f(u))^2- (f(v))^2 |,∀uv∈E(G). If f_sqdp^* is injective then f_sqdp^* is called square difference labeling of G. A graph G which admits square difference labeling is called square difference graph. The greatest Common incidence number (gcin) of a vertex of degree > 1 is defined as the greatest common divisor (g.c.d) of the labels of the incident edges on v. A square difference labeling is said to be a square difference prime labeling if for each vertex v of degree > 1, gcin(v) = 1. In this paper we investigate the square difference prime labeling for Prism graph, Braid graph, Umbrella graph