Square Difference Edge Cordial Labeling Of Some Special Graphs

Abstract

A graph G with p vertices and q edges is said to admit a square difference edge cordial labeling if there is a bijectionf : V(G) →{1,2,..., p}such that for each edge e =uv, the induced map: E(G) →{0,1} is defined by(uv) = 1 if|| is odd, otherwise 0 and|(0)−(1)|≤1 where(0) = edges with label zero and(1) = edges with label one. If a graph admits square difference edge cordial labeling, then it is said to be square difference edge cordial graph. In this paper, it is investigated that the square graph, the shadow graph D₂(P_n), the duplication of apex vertex of bistarB_n,n, the lotus inside a circleLC_n, the bistarB_n,n, the one  point union of cycle C₃ with the star graph K_1,n(n is even), the graph [P _n: S₂], the comb graph, the jewel graphJ_n, the graph (K_n−e)_nand the total graph T(P_n) are square difference edge cordial graph.