Antimagicness for a family of generalized antiprism graphs

Dominique Buset, Mirka Miller, Oudone Phanalasy, Joe Ryan


An antimagic labeling of a graph $G=(V,E)$ is a bijection from the set of edges $E$ to the set of integers $\{1,2,\dots, |E|\}$ such that all vertex weights are pairwise distinct, where the weight of a vertex is the sum of all edge labels incident with that vertex. A graph is antimagic if it has an antimagic labeling. In thisĀ  paper we provide constructions of antimagic labelings for a family of generalized antiprism graphs and generalized toroidal antiprism graphs.


antimagic labeling; antimagic generalized antiprism graph; antimagic generalized toroidal antiprism graph

Full Text:




  • There are currently no refbacks.

ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats