Abstract

In 1987, Cahit [7] introduced cordial labeling as a weaker version of graceful labeling and harmonious labeling. In 2011, Varatharajan \textit{et al.} [16] have introduced divisor cordial labeling as a variant of cordial labeling. In this paper, we investigate divisor cordial labeling for $C_{n}$-quadrilateral snake, degree splitting graph of triangular snake, quadrilateral snake, ladder graph and helm graph. Moreover, we discuss divisor cordial labeling of graphs obtained by duplication of an arbitrary edge by a new vertex in path, duplication of an arbitrary vertex by a new edge in path, duplication of an arbitrary vertex by a new vertex in path and duplication of an arbitrary edge by a new edge in path.

Keywords and Phrases

Graph Labeling, Cordial Labeling, Divisor Cordial Labeling, Graph Operation, Degree Splitting Graph, Duplication of Graph Elements, Snake Graph.

A.M.S. subject classification

05C78, 05C76, 05C38.

.....