Let G be a graph with vertex set V and edge set E , and let A be an abelian group. A labeling f : V → A induces an edge labeling f ∗ : E → A defined by f (xy) = f (x) + f (y). For i ∈ A, let v f (i) = card{v ∈ V : f (v) = i} and e f (i) = card{e ∈ E : f (e) = i}. A labeling f is said to be A-friendly if |v f (i)−v f ( j)| ≤ 1 for all (i, j) ∈ A× A, and A-cordial if we also have |e f (i) − e f (...

Let G be a graph with its vertices and edges. On defining bijective function ρ:V(G) →{0,1,...,p}. For each edge assign the label 1 if ρ*(ab)= | ρ(a) 2 −ρ(b) /ρ(a)−ρ(b) is odd or 0 otherwise such that |eρ(1) − eρ(0)| ≤ then labeling called as divided square difference cordial graph. We prove in this paper for relatively possible set of spider graphs atmost one legs greater than namely J(SP(1 m ,...