An antimagic labeling of a graph \(G=(V,E)\) of size m is a one-to-one mapping \(f: E\rightarrow \{1,2,\ldots ,m\}\) , such that all vertices receive pairwise distinct vertex sums, where a vertex sum of a vertex v in G is the sum of the labels on the edges incident to v. A graph is called antimagic if it admits an antimagic labeling. It was conjectured that every connected graph other than \(K_2\) is antimagic by Hartsfield et al. in 1990. The conjecture remains unsolved, which seems hard for sparse graphs, such as trees, especially for those trees with many vertices of degree 2. A subdivided caterpillar is a tree obtained from a caterpillar by subdividing each leg the same number of times. This paper shows that every subdivided caterpillar is antimagic.
