标题:Neighbor sum distinguishing edge coloring of subcubic graphs
作者:Yu, Xiao Wei; Wang, Guang Hui; Wu, Jian Liang; Yan, Gui Ying
作者机构:[Yu Xiaowei] School of Mathematics, Shandong University, Ji'nan, Shandong 250100, China.;[Wang Guanghui] School of Mathematics, Shandong University, J 更多
通讯作者:Wang, GH(ghwang@sdu.edu.cn)
通讯作者地址:[Wang, GH]Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
来源:数学学报
出版年:2017
卷:33
期:2
页码:252-262
DOI:10.1007/s10114-017-5516-9
关键词:Proper edge coloring; neighbor sum distinguishing edge coloring; maximum; average degree; subcubic graph; planar graph
摘要:A proper edge-k-coloring of a graph G is a mapping from E(G) to {1, 2,..., k} such that no two adjacent edges receive the same color. A proper edge-k-coloring of G is called neighbor sum distinguishing if for each edge uv a E(G), the sum of colors taken on the edges incident to u is different fromthe sumof colors taken on the edges incident to v. Let chi'()(G) pound denote the smallest value k in such a coloring of G. This parameter makes sense for graphs containing no isolated edges (we call such graphs normal). The maximum average degree mad(G) of G is the maximum of the average degrees of its non-empty subgraphs. In this paper, we prove that if G is a normal subcubic graph with mad(G) < 5/2, then chi'()(G) pound <= 5. We also prove that if G is a normal subcubic graph with at least two 2-vertices, 6 colors are enough for a neighbor sum distinguishing edge coloring of G, which holds for the list version as well.
收录类别:CSCD;SCOPUS;SCIE
WOS核心被引频次:2
Scopus被引频次:2
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85008957026&doi=10.1007%2fs10114-017-5516-9&partnerID=40&md5=7dd83046cdd8bc2a2794915b484e1497
TOP