Abstract

A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, . . . , |V(G)|} such that an edge uv is assigned the label 1 if 2 divides f (u) + f (v) and 0 otherwise; and the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a sum divisor cordial labeling is called a sum divisor cordial graph. In this paper, we prove that D2(K1,n), S' (K1,n), D2(Bn,n), DS(Bn,n), S' (Bn,n), S(Bn,n), , S(Ln), Ln O K1, SLn, TLn, TLn O Ki and CHn are sum divisor cordial graphs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call