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

Patcharapan Jumnongnit and Kittikorn Nakprasit

International Journal of Mathematics and Mathematical Sciences, 2017, vol. 2017, 1-4

Abstract:

Let be a graph and be a -total coloring. Let denote the sum of color on a vertex and colors assigned to edges incident to . If whenever , then is called a neighbor sum distinguishing total coloring. The smallest integer such that has a neighbor sum distinguishing -total coloring is denoted by . In 2014, Dong and Wang obtained the results about depending on the value of maximum average degree. A -assignment of is a list assignment of integers to vertices and edges with for each vertex and for each edge . A total- -coloring is a total coloring of such that whenever and whenever . We state that has a neighbor sum distinguishing total- -coloring if has a total- -coloring such that for all . The smallest integer such that has a neighbor sum distinguishing total- -coloring for every -assignment is denoted by . In this paper, we strengthen results by Dong and Wang by giving analogous results for .

Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2017/5897049.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2017/5897049.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:5897049

DOI: 10.1155/2017/5897049

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().