%0 Journal Article
	%A S. Babitha and  J. Baskar Babujee
	%D 2013
	%J International Journal of Mathematical and Computational Sciences
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 77, 2013
	%T Prime Cordial Labeling on Graphs
	%U https://publications.waset.org/pdf/16747
	%V 77
	%X A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |} such that each edge uv is assigned the label 1 if gcd(f(u), f(v)) = 1 and 0 if gcd(f(u), f(v)) > 1, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper we exhibit some characterization results and new constructions on prime cordial graphs.

	%P 848 - 853