标题:Neighbor Sum Distinguishing Chromatic Index of Sparse Graphs via the Combinatorial Nullstellensatz
作者:Xiao-wei YU;Yu-ping GAO;Lai-hao DING;
作者机构:[Xiao-wei YU;Yu-ping GAO;Lai-hao DING]School of Mathematics, Shandong University
来源:Acta Mathematicae Applicatae Sinica
出版年:2018
期:01
页码:135-144
关键词:proper edge coloring;neighbor sum distinguishing edge coloring;maximum average degree;Combinatorial Nullstellensatz
摘要:Let Ф : E(G)→ be an edge coloring of a graph G. A proper edge-k-coloring of G is called neighbor sum distinguishing if. sum from n=(eЭu) to (Ф(e))≠n=(eЭu) to (Ф(e)) for each edge uv∈E(G).The smallest value k for which G has such a coloring is denoted by χ′_Σ(G) which makes sense for gra...
资源类型:期刊论文
原文链接:http://kns.cnki.net/kns/detail/detail.aspx?FileName=YISY201801010&DbName=DKFX2018
TOP