ABSTRACT

A sum divisor cordial labeling of a graph with a vertex set is provided as a bijection such that an edge is assigned to a label. The number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph which admits sum divisor cordial labeling is provided as a sum divisor cordial graph. The graphs obtained by switching of a vertex with one chord are provided as sum divisor cordial graphs. If the vertices or edges or both of the graphs are assigned with values that are subject to certain conditions then it is known as graph labeling. By combining the divisibility concept in number theory and the cordial labeling concept in graph labeling, the notion called divisor cordial labeling is originated. A cycle with triangle is a cycle with three chords which by themselves form a triangle.