Neighbor sum distinguishing index of 2-degenerate graphs
Neighbor sum distinguishing index of 2-degenerate graphs
复制标题
2-简并图的邻域和判别指数
DOI：
10.1007/s10878-017-0110-8
复制
发表时间：
2017
影响因子：
1
通讯作者：
Miao Zhengke
中科院分区：
文献类型：
--
作者：
Hu Xiaolan;Chen Yaojun;Luo Rong;Miao Zhengke
本文考虑图的正常边着色问题。如果对于每一对相邻顶点uandv，与uandv关联的边的颜色之和不同于与v关联的边的颜色之和，则这种着色称为邻和可区分的。在这样的G的着色中，最小的值记为。本文证明了：如果G是一个2-退化的无孤立边图，则.
We consider proper edge colorings of a graphGusing colors in. Such a coloring is called neighbor sum distinguishing if for each pair of adjacent verticesuandv, the sum of the colors of the edges incident withuis different from the sum of the colors of the edges incident withv. The smallest value ofkin such a coloring ofGis denoted by. In this paper we show that ifGis a 2-degenerate graph without isolated edges, then.