Graphs with Bounded Maximum Average Degree and Their Neighbor Sum Distinguishing Total-Choice Numbers

Let G be a graph and ϕ:V(G)∪E(G)→{1,2,3,…,k} be a k-total coloring. Let w(v) denote the sum of color on a vertex v and colors assigned to edges incident to v. If w(u)≠w(v) whenever uv∈E(G), then ϕ is called a neighbor sum distinguishing total coloring. The smallest integer k such that G has a neighb...

Full description

Bibliographic Details
Main Authors: Patcharapan Jumnongnit, Kittikorn Nakprasit
Format: Article
Language:English
Published: Hindawi Limited 2017-01-01
Series:International Journal of Mathematics and Mathematical Sciences
Online Access:http://dx.doi.org/10.1155/2017/5897049