Edge Product Cordial Labeling of Some Cycle Related Graphs
Udayan M. Prajapati, Nittal B. Patel · Open Journal of Discrete Mathematics · 2016
For a graph having no isolated vertex, a function is called an edge product cordial labeling of graph G, if the induced vertex labeling function defined by the product of labels of incident edges to each vertex is such that the number of edges with label 0 and the number of edges with label 1 differ by at most 1 and the number of vertices with label 0 and the number of vertices with label 1 also differ by at most 1. In this paper, we discuss edge product cordial labeling for some cycle related graphs.