Vertex-magic labelings: mutations

被引:0
作者
Gray, I. D. [1 ]
MacDougall, J. A. [1 ]
机构
[1] Univ Newcastle, Sch Math & Phys Sci, Callaghan, NSW 2308, Australia
来源
AUSTRALASIAN JOURNAL OF COMBINATORICS | 2009年 / 45卷
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper, we are studying vertex-magic total labelings of simple graphs. We introduce a procedure called mutation which transforms one labeling into another by swapping sets of edges among vertices. The result of a mutation may be a different labeling of the same graph or a labeling of a different graph. Mutation proves to be a remarkably fruitful process-for example we are able to generate labelings for all the order 10 cubic graphs from a single initial labeling of the 5-prism. We describe all possible mutations of a labeling of the path and the cycle.
引用
收藏
页码:189 / 206
页数:18
相关论文
共 7 条
[1]  
Gray I. D., VERTEX MAGIC LABELIN
[2]   Vertex-magic total labelings of regular graphs [J].
Gray, Ian D. .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (01) :170-177
[3]  
MacDougall J. A, 2002, VERTEX MAGIC LABELIN
[4]  
MacDougall JA, 2002, UTILITAS MATHEMATICA, V61, P3
[5]  
McQuillan D., 2004, Journal of Combinatorial Mathematics and Combinatorial Computing, V48, P103
[6]  
Read R.C., 1998, ATLAS GRAPHS
[7]  
Wallis W D, 2001, MAGIC GRAPHS