Product Cordial Labeling of Some Graphs

Abstract

All the graphs considered in this article are simple and undirected. Let G = (V(G), E(G)) be a simple undirected Graph. A function  is called Product Cordial if the induced function  defined by  satisfies the condition  and  for any , where  and  denotes the number of vertices and number of edges with label  respectively. A Graph G is called Product Cordial graph if its admit Product Cordial labeling. In this article, we have discussed Product Cordial labeling of some interesting graphs.