Face antimagic labelings of antiprisms
Abstract:
The paper deals with the problem of labeling the vertices, edges and faces of a plane graph in such a way that the label of a face and the labels of vertices and edges surrounding that face add up to a weight of that face. A labeling of a plane graph is called dantimagic if for every positive integer s, the s-sided face weights form an arithmetic progression with a difference d. Such a labeling is called super if the smallest possible labels appear on the vertices. In this paper we will consider the antiprism as three cycle parts. The super d-antimagic labelings, for d = 0,1,..., 6, we obtain as combination of the labelings of these cycle parts.
Año de publicación:
2011
Keywords:
- D-antimagic labeling
- Plane graph
- Super d-Antimagic labeling
Fuente:
scopusTipo de documento:
Article
Estado:
Acceso restringido
Áreas de conocimiento:
- Teoría de grafos
- Ciencias de la Computación
- Desconocido
Áreas temáticas de Dewey:
- Principios generales de matemáticas
- Álgebra
- Geometría
Objetivos de Desarrollo Sostenible:
- ODS 11: Ciudades y comunidades sostenibles
- ODS 10: Reducción de las desigualdades
- ODS 16: Paz, justicia e instituciones sólidas