• A RELAXED ABSOLUTE DIVISOR CORDIAL GRAPHS

Abstract

A relaxed absolute divisor cordial labeling of a graph G with vertex set V is a bijection  from V to  {−1, 0, 1} such that each edge uv is assigned the label 1 if |f(u) − f(v)| is even, otherwise 0 with the condition that  |e_f (0) − e_f (1)| ≤ 1. The graph that admits a relaxed absolute divisor cordial labeling is called a relaxed absolute divisor cordial graph.  In this paper, we prove some standard graphs such as path, cycle, wheel, star, and bistar are relaxed absolute divisor cordial graphs.