E-Cordial Labeling of Some Class of Graphs

Resumen

Yilmaz and Cahit in 1997 introduced E-cordial labeling. In this paper, we investigate some new results on E-cordial labeling of some graphs. A binary vertex labeling  with induced labeling  defined by   is called E-cordial labeling of a graph   if the number of vertices labeled 0 and the number of vertices labeled 1 differ by atmost 1 and the number of edges labeled 0 and the number of edges labeled 1 differ by atmost 1. A graph which admits E-cordial labeling is called E-cordial graph.