Antimagicness for a family of generalized antiprism graphs
English

Dominique Buset, Mirka Miller, Oudone Phanalasy, Joe Ryan
2014 Electronic Journal of Graph Theory and Applications  
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, . . . , |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. Antimagicness for a family of
more » ... s for a family of generalized antiprism graphs | Dominique Buset et al.
doi:10.5614/ejgta.2014.2.1.4 fatcat:b5yxu6ufnjhfbovfuwcrltju3i