On Sum Cordialness of Some Fractal Graph

For a graph G with vertex set V is a function f: V(G) →{0.1} with induced edge labeling such that f# : E(G) →{0,1} such that f# (pq) = (f(p) + f(q)) (mod 2) for all pq \(∈\) E(G) is called a sum cordial labeling, If |v(0) - v(1)|\(≤\) 1 and |e(0) - e(1)|\(≤\) 1. A graph that follows sum cordial labeling is called a sum cordial graph. We have proved that Vicsek fractal, Box fractal, Ladder Fractal Graph of Type – 1 to Type – 4 admits sum cordial labeling.