Sum Divisor Cordial Labeling On Some Special Graphs

Abstract

A sum divisor cordial labeling of a graph $G$ with vertex set $V$ is a bijection $f:V(G)\to \left\{1,2,...,|V(G)|\right\}$ such that each edge uv assigned the label $1$ if $2$ divides $f(u)+f(v)$ and $0$ otherwise. Further, the number of edges labeled with $0$ and the number of edges labeled with $1$ differ by at most $1$. A graph with a sum divisor cordial labeling is called a sum divisor cordial graph. In this paper, we prove that the plus graph, umbrella graph, path union of odd cycles, kite and complete binary tree are sum divisor cordial graphs.