This paper deals with \((a, d)\)-antimagic labelings of special graphs called parachutes. After the introduction of the concept of a parachute, the authors succeed in proving the finiteness of two very interesting subsets of the set of all \((a, d)\)-antimagic parachutes by means of a method using the theory of Diophantine equations and other number-theoretical results.
Citation
R. Bodendiek, G. Walther. On \((A, D)\)-Antimagic Parachutes[J], Ars Combinatoria, Volume 042. 129-149. .