A Study on Sum Divisor Cordial Labeling Graphs

Abstract

Cordial labeling refers to a graph  with  vertices and  edges as a sum divisor if there exists a bijection function  such that for each edge  assign the label 1 , if  and 0 otherwise, satisfying the condition  is the number of edges having the label 1 , and  is the number of edges having the label 0 . A graph with sum-divisor cordial labeling is called a sum-divisor cordial graph. In the paper, we establish this alternate triangular belt graph, twig graph, duplication of the top vertex Alternate triangular snake graph, duplication of top vertex Pentagon snake graph, jellyfish  when  and  are even, Spider graph with n spokes .