VERTEX ANTIMAGIC EDGE SLITHER LABELING OF CATERPILLAR GRAPHS

The caterpillar graphs in graph theory are specialized tree structures that has gamut ofapplications far and wide in various fields of science and technology. Because of their simple structure,these caterpillar graphs are easy to construct and a variety of graph theoretic concepts are applied onthem. One such concept is that of labeling. There are different kinds of labeling forms that are appliedfor the caterpillar graphs. In this paper, an attempt has been made to prove that the caterpillar graphadmits a special type of labeling, the vertex antimagic edge slither labeling.