Double Divisor Cordial Labeling of Graphs

Abstract

In this paper a new variant of divisor cordial labeling (DCL) named double divisor cordial labeling (DDCL) is in-troduced. A DDCL of a graph Gω having a node set Vω is a bijection gω from Vω to {1,2,3,…, |Vω |} such that each edge yz is given the label 1 if 2gω (y)/gω (z) or 2gω (z)/gω (y) and 0 otherwise, then the modulus of difference of edges labeled 0 and those labeled 1 do not exceed 1 i.e; |eg ω (0) — eg ω (1)| ≤ 1. If a graph permits a DDCL, then it is known as double divisor cordial graph (DDCG). In this paper we derive certain general results concerning DDCL and establish the same for some well known graphs.