In this paper we prove that the split graphs of 1,n K and are prime cordial graphs. We also show that the square graph of is a prime cordial graph while middle graph of is a prime cordial graph for . Further we prove that the wheel graph admits prime cordial labeling for . , n n B n ï‚³ , n n B n P 8 4 n ï‚³

A divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2,... | |} V such that an edge uv is assigned the label 1 if either ( ) | ( ) f u f v or ( ) | ( ) f v f u and the label 0 if ( ) ( ) f u f v , then number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a divisor cordialâ€¦ (More)

Abstract. A divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2,... | |} V such that an edge uv is assigned the label 1 if ( ) | ( ) f u f v or ( ) | ( ) f v f u and the label 0 otherwise, then number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a divisor cordialâ€¦ (More)

A prime cordial labeling of a graph G with the vertex set V (G) is a bijection f : V (G)â†’ {1, 2, 3, . . . , |V (G)|} 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. A graph which admits prime cordialâ€¦ (More)

The labeling of discrete structures is a potential area of research due to its wide range of applications. The present work is focused on one such labeling called odd harmonious labeling. A graph G is said to be odd harmonious if there exist an injection f : defined by f * (uv) = f (u) + f (v) is a bijection. Here we investigate odd harmonious labeling ofâ€¦ (More)