Vaid, S.; Vyas, N.
(International Journal of Mathematics and Scientific Computing, 2012)
A binary vertex labeling f : E(G) → {0, 1} with
induced labeling f
∗
: V (G) → {0, 1} defined by f
∗ P
(v) =
{f(uv) | uv ∈ E(G)}(mod 2) is called E-cordial labeling of
a graph G if the number of vertices labeled 0 ...