A comprehensive survey on prime cordial and divisor cordial labeling of graphs

Abstract

Abstract This article presents a short and concise survey on prime cordial and divisor cordial labeling of graphs. A prime cordial labeling of a graph G(V,E) is a bijective function f:V(G) → {1,2,…,|V|} such that if each edge xy is assigned the label 1 if gcd(f(x),f(y)) = 1 and 0 if gcd(f(x),f(y)) > 1, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. Further, a divisor cordial labeling of G is a bijection g: V(G) → {1,2,…,|V|} such that an edge st is assigned the label 1 if one g(s) or g(t) divides the other and 0 otherwise, then the number of edges labeled with 0 and the number of edges labelled with 1 differ by at most 1. We call G a divisor cordial graph if it admits a divisor cordial labeling. This article stands divided into five sections. The first and fifth sections are reserved respectively for introduction and some important references. The second section deals with the prime cordial labeling of certain classes of graphs wherein some important known results have been recalled. The third section deals with the divisor cordial labeling of graphs in which a few known results of high interest have been outlined. In the fourth section we highlight certain conjectures and open problems in respect of the above mentioned labelling that still remain unsolved.