Some Results on Integer Edge Cordial Graph

An integer edge cordial labeling of a graph G with edge set E is an injective map f from E to [ −q 2 .. q 2 ] ∗ or [−b q 2 c..b q 2 c] as q is even or odd, which induces a vertex labeling f ∗ : V → {0,1} such that, a vertex u is assigned the label 1 if ∑ i f ∗ (ei) ≥ 0 , and 0 otherwise and the number of vertices labeled with 1 and the number of vertices labeled with 0 differs atmost by 1. If a graph has integer edge cordial labeling then it is called integer edge cordial graph. In this paper, we introduce the concept of integer edge cordial labeling and prove that some standard graphs such as path, cycle, wheel, helm, closed helm, star graph K1,n are integer edge cordial and Kn,n is not integer edge cordial. It is also proved that KnnM is integer edge cordial if n is even where M is a perfect matching of Knn.