Prime Cordial Labeling of Generalized Prism Graph

AUTHOR AND
AFFILIATION

U. M. PRAJAPATI1 and S. J. GAJJAR2
1Department of Mathematics, St. Xavier’s College, Ahmedabad – 380009 (India)
2General Department, Government Polytechnic, Himmatnagar – 383001 (India)
E-mail: gjr.sachin@gmail.com E-mail: udayan64@yahoo.com

KEYWORDS:

Graph Labeling, Prime cordial Labeling, Generalized Prism graph. AMS subject classification number: 05C78

Issue Date:

December 2015

Pages:

ISSN:

2319-8044 (Online) – 2231-346X (Print)

Source:

Vol.27 – No.3

PDF

Click Here Download PDF

DOI:

jusps-A

ABSTRACT:

In this paper the authors have proved that prism graph Yn,2 is prime cordial except n = 1, 2 and 4 and the graph Yn,4 also
prime cordial for n  3. We have also proved that the generalized prism graph Y3,n, Y5,n, Y6,n and Y2p,n (for odd prime p) are prime cordial for n > 1 and Y4,n is also prime cordial for n > 2.

Copy the following to cite this Article:

U. M. PRAJAPATI1 and S. J. GAJJAR2, “Prime Cordial Labeling of Generalized Prism Graph”, Journal of Ultra Scientist of Physical Sciences, Volume 27, Issue 3, Page Number , 2016


Copy the following to cite this URL:

U. M. PRAJAPATI1 and S. J. GAJJAR2, “Prime Cordial Labeling of Generalized Prism Graph”, Journal of Ultra Scientist of Physical Sciences, Volume 27, Issue 3, Page Number , 2016

Available from: http://www.ultrascientist.org/paper/368/


In this paper the authors have proved that prism graph Yn,2 is prime cordial except n = 1, 2 and 4 and the graph Yn,4 also
prime cordial for n  3. We have also proved that the generalized prism graph Y3,n, Y5,n, Y6,n and Y2p,n (for odd prime p) are prime cordial for n > 1 and Y4,n is also prime cordial for n > 2.