Numbers of edges in supermagic graphs
Numbers of edges in supermagic graphs
复制标题
DOI：
10.1002/jgt.v52:1
复制
发表时间：
2006-05
影响因子：
0.9
通讯作者：
Svetlana Drajnová;J. Ivanco;Andrea Semaničová
中科院分区：
文献类型：
--
作者：
Svetlana Drajnová;J. Ivanco;Andrea Semaničová
如果一个图允许用两两不同的连续整数对其边进行标记，使得与某个顶点相关的边的标记之和与该特定顶点无关，则该图被称为超幻图。本文建立了超幻图中边数的若干界限。©2005 Wiley期刊公司[J] .图论学报（自然科学版），2006
A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we establish some bounds for the number of edges in supermagic graphs. © 2005 Wiley Periodicals, Inc. J Graph Theory 52: 15–26, 2006