Vertex-distinguishing proper edge-colorings
Vertex-distinguishing proper edge-colorings
复制标题
DOI：
10.1002/(sici)1097-0118(199710)26:2
复制
发表时间：
1997-10
期刊：
影响因子：
--
通讯作者：
A. C. Burris;R. Schelp
中科院分区：
文献类型：
--
作者：
A. C. Burris;R. Schelp
如果每两个不同的顶点都关联到不同的着色边集，则称为点区分。简单图G的可区分顶点的适当边着色所需的最小颜色数表示为。一个简单的计数表明，其中ni表示g中i度的顶点数，我们证明其中C是一个常数，仅取决于Δ。对于特殊类型的图，特别是树，也给出了一些结果。©1997 John Wiley & Sons, Inc[J] .图论学报（自然科学版），1997
An edge-coloring is called vertex-distinguishing if every two distinct vertices are incident to different sets of colored edges. The minimum number of colors required for a vertex-distinguishing proper edge-coloring of a simple graph G is denoted by . A simple count shows that where ni denotes the number of vertices of degree i in G. We prove that where C is a constant depending only on Δ. Some results for special classes of graphs, notably trees, are also presented. © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 73–82, 1997