共 50 条
ON MAGIC JOINS OF GRAPHS
被引:0
|作者:
Ivanco, Jaroslav
Pollakova, Tatiana
机构:
来源:
关键词:
magic graph;
supermagic graph;
join of graphs;
D O I:
暂无
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.
引用
收藏
页码:459 / 472
页数:14
相关论文