Table of Contents
ISRN Combinatorics
Volume 2014 (2014), Article ID 607018, 9 pages
Research Article

Some New Results on Prime Cordial Labeling

1Saurashtra University, Rajkot, Gujarat 360005, India
2Government Polytechnic, Rajkot, Gujarat 360003, India

Received 7 January 2014; Accepted 18 February 2014; Published 23 March 2014

Academic Editors: E. Manstavicius, J. Rada, and F. Rosselló

Copyright © 2014 S. K. Vaidya and N. H. Shah. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


A prime cordial labeling of a graph with the vertex set is a bijection such that each edge is assigned the label 1 if and 0 if ; then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph which admits a prime cordial labeling is called a prime cordial graph. In this work we give a method to construct larger prime cordial graph using a given prime cordial graph . In addition to this we have investigated the prime cordial labeling for double fan and degree splitting graphs of path as well as bistar. Moreover we prove that the graph obtained by duplication of an edge (spoke as well as rim) in wheel admits prime cordial labeling.