标题:∑ bounded maximum average degree
作者:Dong, Aijun ;Wang, Guanghui ;Zhang, Jianghua
作者机构:[Dong, Aijun ] School of Science, Shandong Jiaotong University, Jinan, 250023, China;[Zhang, Jianghua ] School of Management, Shandong University, Jin 更多
通讯作者:Wang, G
来源:Discrete Applied Mathematics
出版年:2014
卷:166
页码:84-90
DOI:10.1016/j.dam.2013.10.009
摘要:A proper [k]-edge coloring of a graph G is a proper edge coloring of G using colors of the set [k], where [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∑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 nd(G), we denote the smallest value k in such a coloring of G. The average degree of a graph G is Σv∑V(G)d(v)|V(G)|; we denote it by ad(G). The maximum average degree mad(G) of G is the maximum of average degrees of its subgraphs. In this paper, we show that, if G is a graph without isolated edges and mad(G)≤52, then nd(G)≤k, where k=max{Δ(G)+1,6}. This partially confirms the conjecture proposed by Flandrin et al. © 2013 Elsevier B.V. All rights reserved.
收录类别:EI
资源类型:期刊论文
TOP