On the relations between certain graph labelings Original Research Article

This paper deals with certain edge labelings of graphs. After having introduced the concepts of a weak antimagic graph and an Egyptian magic graph, the authors showed that every connected graph of order ⩾ 3 is weakly antimagic and proved some interesting relations between the different edge labelings.