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

Udayan M. Prajapati, Karishma K. Raval
2016 Open Journal of Discrete Mathematics  
A graph 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.
doi:10.4236/ojdm.2016.64022 fatcat:xdhk6eakdbh2bkoc2rxrgrzve4