Super d-antimagic labelings of disconnected plane graphs

被引:21
作者
Baca, Martin [1 ]
Miller, Mirka [2 ,3 ,5 ]
Phanalasy, Oudone [2 ,4 ]
Semanicova-Fenovcikova, Andrea [1 ]
机构
[1] Tech Univ, Dept Appl Math, Koice 04200, Slovakia
[2] Univ Newcastle, Sch Elect Engn & Comp Sci, Callaghan, NSW 2308, Australia
[3] Univ W Bohemia, Dept Math, Plzen 32300, Czech Republic
[4] Natl Univ Laos, Dept Math, Viangchan 7322, Laos
[5] Kings Coll London, Dept Comp Sci, London WC2R 2LS, England
关键词
Plane graph; d-antimagic labeling; super d-antimagic labeling; disjoint union of graphs; MAGIC LABELINGS; PRISMS;
D O I
10.1007/s10114-010-9502-8
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This 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 the vertices and edges surrounding that face add up to a weight of that face, and the weights of all s-sided faces constitute an arithmetic progression of difference d, for each s that appears in the graph. The paper examines the existence of such labelings for disjoint union of plane graphs.
引用
收藏
页码:2283 / 2294
页数:12
相关论文
共 25 条
[1]  
ALI G, UTIL MATH IN PRESS
[2]  
[Anonymous], ACTA MECH SLOVACA
[3]  
[Anonymous], RES EXP MATH
[4]  
Baca M., 2003, Journal of Combinatorial Mathematics and Combinatorial Computing, V44, P199
[5]  
Baca M, 2004, UTILITAS MATHEMATICA, V66, P231
[6]  
Baca M, 2004, ARS COMBINATORIA, V73, P115
[7]  
BACA M, 1992, ARS COMBINATORIA, V33, P295
[8]   ON MAGIC LABELINGS OF HONEYCOMB [J].
BACA, M .
DISCRETE MATHEMATICS, 1992, 105 (1-3) :305-311
[9]  
BACA M, UTIL MATH IN PRESS
[10]  
Baca M, 2007, UTILITAS MATHEMATICA, V72, P65