Let an injective function f from vertex set V of a graph G to the (F0, F1, F2, ..., Fn), where Fj is jth Fibonacci number (j=0, 1, n), said be cordial labeling if induced f* edge E {0,1} defined by (uv) = (f(u)+f(v)) (mod2) satisfies condition |ef(0)- ef(1) ≤ ef(0) edges with label 0 and 1. A which admits called graph.
