Prime Cordial Labeling of Some Graphs

Abstract

A bijectionfrom the vertex set V of a graph G to {1,2,…|V|} is called a prime cordial labeling of G if each edge uv is assigned the label 1 if gcd (f (u), f (v)) = 1 and 0 if gcd (f (u), f (v)) > 1, where the number of edges labeled with 0 and the number of edges labeled with 1 differ at most by one. In this paper we prove that 8-polygonal snake containing n number of 8-polygon, Splitting graph of Cn for n ≥ 5 and Armed Crown C2k Pm for all k ≥ 3 and m ≥ 2 admit prime cordial labeling.