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

作　　者：Udayan M. Prajapati Karishma K. Raval Udayan M. Prajapati;Karishma K. Raval(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》2016年第4期259-267,共9页离散数学期刊（英文）

摘　　要：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.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.

关 键 词：Product Cordial Labeling Gear Graph DUPLICATION Vertex Switching 

分 类 号：O15[理学—数学]