Graphs are one of the most fascinating topics in the field of mathematics having a wide range of applications that stretch from extreme science and technology to daily life. Many graph theoretic concepts have proved to be effective when collaborated with other fields of science. One such notion in graph theory is the caterpillar graphs. The structure of the caterpillar graph is easy to construct and comprehend. Therefore, applying caterpillar graphs different conceptions in graph theory is intriguing. to One such intriguing concept is that of labeling. In this paper, the applicability of vertex antimagic edge slither labeling to the caterpillar graph is attempted.