Some Results on I-cordial Graph

An I-cordial labeling of a graph G (V, E) is an injective map f from V to [-p/2. . p/2]^*or [-p/2. . p/2] as p is even or odd, which induces an edge labeling f* E {0, 1} defined by f* (uv) = 1 if f (u) + f (v) greater than 0 and f* (uv) = 0 otherwise, such that the number of edges labeled with1and the number of edges labeled with 0 differ atmost by 1. If a graph has I-cordial labeling, then it is called I-cordial graph. In this paper, we introduce the concept of I-cordial labeling and prove that some standard graphs that are I-cordial and some graph that are not I-cordial.