Research ArticleOpen AccessGoogle Scholar indexed
Product Cordial Graph in the Context of Some Graph Operations on Gear Graph
St. Xavier’s College, Ahmedabad, India
Ahmedabad Institute of Technology, Ahmedabad, India
- 1 St. Xavier’s College, Ahmedabad, India
- 2 Ahmedabad Institute of Technology, Ahmedabad, India
Open Journal of Discrete Mathematics·Volume 06 (2016)·Pages 259–267·Published 16 August 2016·DOI10.4236/ojdm.2016.64022
Copy link · social · email
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.
KeywordsProduct Cordial LabelingGear GraphDuplicationVertex Switching
- Gross, J. and Yellen, J. (2004) Handbook of Graph Theory. CRC Press, Boca Raton.
- Gallian, J.A. (2014) A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics, 17, #DS6.
- Sundaram, M., Ponraj, R. and Somasundaram, S. (2004) Product Cordial Labeling of Graphs. Bulletin of Pure & Applied Sciences—Mathematics & Statistics, 23E, 155-163.
- Vaidya, S.K. and Barasara, C.M. (2012) Further Results on Product Cordial Labeling. International Journal of Mathematical Combinatorics, No. 3, 64-71.
- Vaidya, S.K. and Barasara, C.M. (2011) Product Cordial Graphs in the Context of Some Graph Operations. International Journal of Computing Science and Mathematics, 1, 1-6.
- Vaidya, S.K., Srivastav, S., Kaneria, V.J. and Kanani, K.K. (2010) Some Cycle Related Cordial Graphs in the Context of Vertex Switching. Proceedings of International Conference on Discrete Mathematics, 2008 RMS Lecturer Note Series, No. 13, 243-252.