Signed mean e-cordial labeling

Let G be a simple (p, q) graph and let f: E(G)→{-1, +2, -3,..} be a mapping with the induced labeling f*: V(G) →{0, 1} defined by f*(V)= ∑ f(u + v)/(u + v ∈ E(G)(mod 2) then f is called a Signed mean E-cordial labeling of a graph G if the number of vertices labeled with 0 and number of vertices labeled with 1 differ by atmost 1 and the number of edges labeled with alternative signed integers.

A graph G which admits Signed mean E-cordial labeling is called a Signed mean Ecordial graph.

Here, we have proved that wheel graph, circulant graph, Petersen graph and Gear graph admit Signed mean E-cordial labeling.