共 50 条
Irregularity strength and compound graphs
被引:10
|作者:
Togni, O
[1
]
机构:
[1] Univ Bordeaux 1, UMR 5800, LaBRI, F-33405 Talence, France
关键词:
irregularity strength;
irregular degree;
edge labelling;
compound graph;
D O I:
10.1016/S0012-365X(99)00305-2
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
The irregularity strength of a graph G is the smallest possible value of k or which we can assign positive integers not greater than k to the edges of G, in such a way that the sums at each vertex are distinct numbers. In this paper, we study the irregularity strength in relation with a graph composition. We prove a general bound for the irregularity strength of regular compound graphs and derive exact results for some infinite families of graphs. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:235 / 243
页数:9
相关论文