Some results on integer cordial graph

Abstract

An integer cordial labeling of a graph G(V, E) is an injective map f from V to or  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) ≥ 0 is positive and 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 integer cordial labeling, then it is called integer cordial graph. In this paper, we introduce the concept of integer cordial labeling and prove that some standard graphs are integer cordial.