Vertex Odd Divisor Cordial Labeling of Ring Sum of Different Graphs With star Graph

Abstract

A graph tt = (V, E) is said to have a vertex odd divisor cordial labeling if there is a bijection f : {1, 3, . . . , 2n − 1} such that each edge e = uv is assigned the label 1 if f (u)|f (v) or f (v)|f (u) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. If a graph admits a vertex odd divisor cordial labeling, then it is called vertex odd divisor cordial graph. In this paper we have derived vertex odd divisor cordial labeling of ring sum of different graphs.