@article{(Open Science Index):https://publications.waset.org/pdf/16747,
	  title     = {Prime Cordial Labeling on Graphs},
	  author    = {S. Babitha and  J. Baskar Babujee},
	  country	= {},
	  institution	= {},
	  abstract     = {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.
},
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {7},
	  number    = {5},
	  year      = {2013},
	  pages     = {848 - 853},
	  ee        = {https://publications.waset.org/pdf/16747},
	  url   	= {https://publications.waset.org/vol/77},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 77, 2013},
	}