Product Cordial Graph in the Context of Some Graph Operations on Gear Graph

Abstract

A graph is said to be a product cordial graph if there exists a function with each edge assign the label , such that the number of vertices with label 0 and the number of vertices with label 1 differ atmost by 1, and the number of edges with label 0 and the number of edges with label 1 differ by atmost 1. We discuss the product cordial labeling of the graphs obtained by duplication of some graph elements of gear graph. Also, we derive some product cordial graphs obtained by vertex switching operation on gear graph.