PRODUCT CORDIAL LABELING OF GRAPHS RELATED TO HELM, CLOSED HELM AND GEAR GRAPH
Gaurang V. Ghodasara, S. M. Vaghasiya · International Journal of Pure and Apllied Mathematics · 2014
We prove that path union of finite copies of helm, closed helm, gear graph are product cordial graphs.Further we prove that the graph obtained by joining two copies of helm by a path of arbitrary length is product cordial graph.We prove similar results for closed helm and gear graph.