Sum Divisor Cordial Labeling of Theta Graph
Arunachalam Sugumaran, K. Rajesh · Annals of Pure and Applied Mathematics · 2017
A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2,...,| |} V 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 Theta graph a T , fusion of any two vertices in the cycle of a T , duplication of any vertex i v in the cycle of a T , switching of a central vertex in a T , path union of two copies of a T , star of Theta graph are sum divisor cordial graphs.