Let G(V, E) be a graph with pvertices and qedges. f∶ V (G) → {0,1,2,…, p-1} bijection such that the induced function f*: E(G) N defined by f_sqdp* (uv)=|[f(u) ]2-[f(v) ]2 | for everyuv∈E(G).If is injective, then f_sqdp*is calledsquare difference labeling of G.A Gwhich admits square called graph. The greatest common incidence number (gcin) vertex v degree > 1 as divisor (g.c.d) labels inciden...