Prime Cordial Labeling of the graph P (a, b)

Gayathri | Sekar

Prime Cordial Labeling

Vol: 4; Iss: 5; May 18 | ISSN: 2454-5422

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 by at most 1.