Antimagic Labeling of Pumpkin Graph

Abstract

A graph with  edges is called antimagic if its edges can be labeled with  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..