SP Mean E-Cordial Labeling

Assigning an integer to a vertices or edges is called a vertex or edge labeling respectively. Suppose G is a simple graph. Consider the function f  for the edge set . For each vertex t , define f(t)= (mod2). The function f is known as an E-cordial labeling (E-CL) of G if , and  where , and ,  are the number of edges and vertices labeled with 0 and labeled by 1 respectively. A graph that admits E-CL is said to be E-cordial graphs (E-CG).  Based on the above definition we propose a novel labeling known as SP Mean E-cordial labeling (E-CL). In this paper, we study SP Mean E-CL of several families of graphs such as complete bipartite graphs, complete graphs, wheels, etc.