PRODUCT AND EDGE PRODUCT CORDIAL LABELING OF DEGREE SPLITTING GRAPH OF SOME GRAPHS
Let be a graph with where each is a set of all the vertices having same degree with at least two elements and The degree splitting graph is obtained from G by adding vertices and joining to each vertex of for We explore the concept of product and edge product cordial labeling in the context of degree splitting graphs of path, shell, bistar and gear graph.
product cordial labeling, edge product cordial labeling, degree splitting graph.