Vertex-distinguishing proper edge colourings of some regular graphs

被引：5
|
作者：
Rudasova, Janka [1 ]
Sotak, Roman [1 ]
机构：
[1] Safarik Univ, Fac Sci, Inst Math, Kosice 04154, Slovakia
来源：
DISCRETE MATHEMATICS | 2008年 / 308卷 / 5-6期
关键词：
edge colouring; vertex-distinguishing index; equitable colouring;
D O I：
10.1016/j.disc.2007.07.019
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The venex-distinguishing index chi(s)'(G) of a graph G is the minimum number of colours required to properly colour the edges of G in such a way that any two vertices are incident with different sets of colours. We consider this parameter for some regular graphs. Moreover, we prove that for any graph, the value of this invariant is not changed if the colouring above is, in addition, required to be equitable. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：795 / 802
页数：8
相关论文
共 50 条
12345