A graph G(V, E) is said to be edge-cordial if it is possible to label the edges with the set {0, 1}, with the induced vertex labeling f (v) computed by ( )  ( ) (mod 2)   uv E f v f uv for each v V , such that E f (0)  E f (1)  1 and V f (0)  V f (1)  1 , where E (i) f and V (i) f , i = 0, 1, are the number of edges and vertices labeled with 0 and 1 respectively. An edge-cordial labeling in which the number of vertices and edges labeled with 0 and the number of vertices and edges labeled with 1 differ by at most 1 (i.e) Vf (0)  E f (0)  Vf (1)  E f (1)  1 is called as a total edge-cordial labeling. In this paper, we have examined the existence of edge-cordial and total edge cordial labeling of the fractal graphs derived from KochCurve and Koch Snowflake.