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

HTML  XML Download Download as PDF (Size: 1744KB)  PP. 259-267  
DOI: 10.4236/ojdm.2016.64022    1,936 Downloads   3,899 Views  Citations

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.

Share and Cite:

Prajapati, U. and Raval, K. (2016) Product Cordial Graph in the Context of Some Graph Operations on Gear Graph. Open Journal of Discrete Mathematics, 6, 259-267. doi: 10.4236/ojdm.2016.64022.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.