Extended results on sum divisor cordial labeling

Abstract

A sum divisor cordial labeling of a graph G with vertex set V(G) is a bisection f: V(G)rarr;1,2,...,V(G) such that an edge uv assigned the label 1 if 2 divides f(u)+f(v) and 0 otherwise. Further the number of edges labeled urith 0 and the the number of edges labeled with 1 differ by atmost 1. A graph with sum divisor cordial labeling is called a sum divisor cordial graph. In this paper we prove that the graphs Pn + Pn (n is odd), PnK1, m, CnK1, m (n is odd), Wn*K1, m (n is even), are sum divisor cordial graphs.