On d-antimagic labelings of prisms
Abstract:
We refer to a labeling of a plane graph as a d-antimagic labeling if the vertices, edges and faces of the graph are labeled 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 the face and the weights of faces constitute an arithmetical progression of difference d. In this paper we deal with d-antimagic labeling of prisms.
Año de publicación:
2004
Keywords:
Fuente:
scopus
Tipo de documento:
Article
Estado:
Acceso restringido
Áreas de conocimiento:
- Optimización matemática
- Optimización matemática
Áreas temáticas:
- Principios generales de matemáticas