Antimagic labeling of generalized pyramid graphs

Abstract

An antimagic labeling of a graph with q edges is a bijection from the set of edges to the set of positive integers {1, 2, ..., q} such that all vertex weights are pairwise distinct, where the vertex weight of a vertex is the sum of the labels of all edges incident with that vertex. A graph is antimagic if it has an antimagic labeling. In this paper, we provide antimagic labelings for a family of generalized pyramid graphs.[PUBLICATION ABSTRACT]