On d-antimagic labelings of plane graphs
Main Authors: | Baca, Martin; Department of Applied Mathematics and Informatics, Technical University, Kosice, Brankovic, Ljiljana; School of Electrical Engineering and Computer Science, The University of Newcatle, Lascsakova, Marcela; Department of Applied Mathematics and Informatics, Technical University, Kosice, Phanalasy, Oudone; Department of Mathematics, National University of Laos, Vientiane, Semanicova-Fenovciova, Andrea; Department of Applied Mathematics and Informatics, Technical University, Kosice |
---|---|
Format: | Article info application/pdf eJournal |
Bahasa: | eng |
Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2013
|
Subjects: | |
Online Access: |
http://www.ejgta.org/index.php/ejgta/article/view/16 http://www.ejgta.org/index.php/ejgta/article/view/16/3 |
Daftar Isi:
- The paper deals with the problem of labeling the vertices and edges of a plane graph in such a way that the labels of the vertices and edges surrounding that face add up to a weight of that face. A labeling of a plane graph is called d-antimagic 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 the paper we examine the existence of such labelings for several families of plane graphs.