标题:Neighbor Sum Distinguishing Edge Colorings of Graphs with Small Maximum Average Degree
作者:Gao, Yuping; Wang, Guanghui; Wu, Jianliang
作者机构:[Gao, Yuping; Wang, Guanghui; Wu, Jianliang] Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
通讯作者:Wang, GH
通讯作者地址:[Wang, GH]Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
来源:BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY
出版年:2016
卷:39
页码:S247-S256
DOI:10.1007/s40840-015-0207-0
关键词:Proper edge coloring; Neighbor sum distinguishing edge coloring; Maximum; average degree
摘要:A proper edge-k-coloring of a graph G is an assignment of k colors 1, 2, . . . , k to the edges of G such that no two adjacent edges receive the same color. A neighbor sum distinguishing edge-k-coloring of G is a proper edge-k-coloring of G such that for each edge uv is an element of E(G), the sum of colors taken on the edges incident with u is different from the sum of colors taken on the edges incident with v. By ndi(Sigma)(G), we denote the smallest value k in such a coloring of G. The maximum average degree of G is mad(G) = max {2 vertical bar E(H)vertical bar/vertical bar V(H)vertical bar}, where the maximum is taken over all the non-empty subgraphs H of G. In this paper, we obtain that if G is a graph without isolated edges and mad(G) < 8/3, then ndi(Sigma)(G) <= k where k = max{Delta(G) + 1, 6}. It partially confirms the conjecture proposed by Flandrin et al.
收录类别:SCOPUS;SCIE
WOS核心被引频次:3
Scopus被引频次:4
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84976317490&doi=10.1007%2fs40840-015-0207-0&partnerID=40&md5=9a2dd31d7617bf52f3fcb90656c09411
TOP