IJPAM: Volume 91, No. 4 (2014)

PRODUCT CORDIAL LABELING OF GRAPHS RELATED
TO HELM, CLOSED HELM AND GEAR GRAPH

G.V. Ghodasara$^1$, S.M. Vaghasiya$^2$
$^1$H.&H.B. Kotak Institute of Science
Rajkot, Gujarat, INDIA
$^2$R.K. University
Rajkot, Gujarat, INDIA


Abstract. 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.

Received: December 4, 2013

AMS Subject Classification: 05C78

Key Words and Phrases: product cordial labeling, helm, closed helm, gear graph

Download paper from here.



DOI: 10.12732/ijpam.v91i4.6 How to cite this paper?
Source:
International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2014
Volume: 91
Issue: 4