E-resources
Peer reviewed
Open access
-
Sharma, Vishally; Parthiban, A
Journal of physics. Conference series, 05/2022, Volume: 2267, Issue: 1Journal Article
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 2 g ω ( y )/ g ω ( z ) or 2 g ω ( 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; | e g ω (0) — e g ω (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.
