标题:Neighbor sum distinguishing index of planar graphs
作者:Wang, Guanghui; Chen, Zhumin; Wang, Jihui
作者机构:[Wang, Guanghui] Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China.; [Chen, Zhumin] Shandong Univ, Sch Comp Sci, Jinan 250100, People 更多
通讯作者:Wang, GH
通讯作者地址:[Wang, GH]Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China.
来源:DISCRETE MATHEMATICS
出版年:2014
卷:334
页码:70-73
DOI:10.1016/j.disc.2014.06.027
关键词:Neighbor sum distinguishing index; Planar graph; Adjacent vertex; distinguishing coloring
摘要:A proper [k]-edge coloring of a graph G is a proper edge coloring of G using colors from [k] = {1, 2,..., k}. A neighbor sum distinguishing [k]-edge coloring of G is a proper [k]edge coloring of G such that for each edge uv epsilon E(G), the sum of colors taken on the edges incident to u is different from the sum of colors taken on the edges incident to v. By nsdi(G), we denote the smallest value k in such a coloring of G. It was conjectured by Flandrin et al. that if G is a connected graph without isolated edges and G not equal C-5, then nsdi(G) <= Delta(G) +2. In this paper, we show that if G is a planar graph without isolated edges, then nsdi(G) <= max{Delta(G) + 10, 25}, which improves the previous bound (max{2 Delta(G) + 1, 25}) due to Dong and Wang. (C) 2014 Elsevier B.V. All rights reserved.
收录类别:SCOPUS;SCIE
WOS核心被引频次:19
Scopus被引频次:20
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84904907290&doi=10.1016%2fj.disc.2014.06.027&partnerID=40&md5=3540886e2638b990e21f585f94102390
TOP