Cube Divisor Cordial Labeling of Some Standard Graphs

A cube divisor cordial labeling of a graph $G$ with vertex set $V(G)$ is a bijection $f$ from $V(G)$ to ${1,2,ldots,|V(G)|}$ such that an edge $e=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)|leq1$. 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.