Edge Product Cordial Labeling Research Articles

Some Edge Product Cordial Graphs

For a graph $G=(V(G), E(G))$, a function $ f : E(G) \rightarrow \{0, 1\}$ is called an edge product cordial labeling of $G$ if the induced vertex labeling function defined by the product of incident edge labels be such that the edges with label 1 and label 0 differ by at most 1 and the vertices with label 1 and label 0 also differ by at most 1. In this paper we investigate some new families of edge product cordial graph.

Total edge product cordial labeling of graphs

The total product cordial labeling is a variant of cordial labeling. We introduce an edge analogue product cordial labeling as a variant of total product cordial labeling and name it as total edge product cordial labeling. Unlike to total product cordial labeling the roles of vertices and edges are interchanged in total edge product cordial labeling. We investigate several results on this newly defined concept.