摘要
Aproper[h]-totalcoloringcofagraphGisapropertotalcoloringcofGusingcolorsoftheset[h]={1,2,...,h}.Letw(u)denotethesumofthecoloronavertexuandcolorsonalltheedgesincidenttou.Foreachedgeuv∈E(G),ifw(u)≠w(v),thenwesaythecoloringcdistinguishesadjacentverticesbysumandcallitaneighborsumdistinguishing[h]-totalcoloringofG.Bytndi(G),wedenotethesmallestvaluehinsuchacoloringofG.Inthispaper,weobtainthatGisagraphwithatleasttwovertices,ifmad(G)<3,thentndi∑(G)≤k+2wherek=max{Δ(G),5}.Itpartiallycon?rmstheconjectureproposedbyPil′sniakandWozniak.
出版日期
2014年04月14日（中国期刊网平台首次上网日期，不代表论文的发表时间）
