an:06299411
Zbl 1408.05061
Dong, Ai Jun; Wang, Guang Hui
Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
EN
Acta Math. Sin., Engl. Ser. 30, No. 4, 703-709 (2014).
00331300
2014
j
05C15 05C07
total coloring; neighbor sum; average degree
Summary: A proper \([h]\)-total coloring \(c\) of a graph \(G\) is a proper total coloring \(c\) of \(G\) using colors of the set \([h]=\{1,2,\dots,h\}\). Let \(w(u)\) denote the sum of the color on a vertex \(u\) and colors on all the edges incident to \(u\). For each edge \(u_v\in E(G)\), if \(w(u)\neq w(v)\), then we say the coloring \(c\) distinguishes adjacent vertices by sum and call it a neighbor sum distinguishing \([h]\)-total coloring of \(G\). By \(\mathrm{tndi}_\Sigma(G)\), we denote the smallest value \(h\) in such a coloring of \(G\). In this paper, we obtain that \(G\) is a graph with at least two vertices, if \(\mathrm{mad}(G)<3\), then \(\mathrm{tndi}_\Sigma(G)\leq k+2\) where \(k=\max\{\Delta(G),5\}\). It partially confirms the conjecture proposed by \textit{M. Pil??niak} and \textit{M. Wo??niak} [``On the adjacent vertex distinguishing index by sums in total proper colorings'', Preprint MD 051, Instytut Informatyki i Matematyki Komputerowej, Uniwersytetu Jagiello??skiego].