Some Results on E-cordial Labeling

Abstract

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 and number of vertices labeled 1 differ by at most 1 and the number of edges labeled 0 and the number of edges labeled 1 differ by at most 1. A graph which admits E-cordial labeling is called E-cordial graph. Here we prove that flower graph F ln, closed helm CHn, double triangular snake DTn and gear graph Gn are E-cordial graphs.