Cordial Labeling in the Context of Some Graphs

Let G=(V,E) be the graph. A mapping f:V→{0,1} is called Binary vertex labeling and f(v) is called the label of the vertex v of G under f . For an edge e=uv, the induced edge labeling f^*:E→{0,1} is given by f^* (e)=|f(u)-f(v)|. Let f:V→{0,1} and for each edge uv, assign the label |f(x) – f(y)|. Then the binary vertex labeling f of a graph G is said to be cordial labeling if |V_f (0)-V_f (1)|≤1 and |e_f (0)-e_f (1)|≤1. In this paper, some graphs are proved for cordial labeling and known to be cordial graph.