Sum Divisor Cordial Labeling of T p -Tree Related Graphs

Abstract

A sum divisor cordial labeling of a graph G with vertex set V ( G ) is a bijection f from V ( G ) to { 1 , 2 , ⋯ , | V ( G ) | } such that an edge u v is assigned the label 1 if 2 divides f ( u ) + f ( v ) and 0 otherwise; and the number of edges labeled with 1 and the number of edges labeled with 0 differ by at most 1 . A graph with a sum divisor cordial labeling is called a sum divisor cordial graph. In this paper, we discuss the sum divisor cordial labeling of transformed tree related graphs.