Divisor Labeling of Some Special Graphs

Abstract

An assignment of labels (mostly, integers) to the vertices of a graph G(V,E), or simply G, on n vertices subject to certain constraints is called a vertex labeling of G. A graph G is a divisor graph if the vertices of G can be labeled with integers (necessarily distinct) in such a way that either x|y or y|x for any two adjacent vertices x and y. In this paper, we encounter the divisor labeling of certain classes of graphs.