1
2
3
*Corresponding Author: Jeba Jesintha J,
A graph with q edges is called antimagic if its edges can be labeled with 1,2,…,q without repetition such that the sums of the labels of the edges incident to each vertex are distinct. A graph which admits an antimagic labeling is called an antimagic graph. In this paper, we prove that the Pumpkin graph admit antimagic labeling.
Antimagic labeling, Pumpkin Graph