Cube Divisor Cordial Labeling of some Standard Graphs

Abstract

The present authors are motivated by two research articles Di- visor Cordial Graphs by Varatharajan et al. and Square Divisor Cordial Graphs by Murugesan et al. We introduce the concept of cube divisor cor- dial labeling. A cube divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2,…,|v|} such that an edge uv is assigned the label 1 if [f(u)] 3 |f(v) or [f(v)] 3 |f(u) and the label 0 otherwise, then |e f (0) -e f (1)| ≤ 1. A graph which admits a cube divisor cordial labeling is called a cube divisor cordial graph . In this paper we discuss cube divisor cordial labeling of some standard graphs such as path, cycle, wheel, flower and fan.