标题:Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
作者:Xu, Renyu; Wu, Jianliang; Xu, Jin
作者机构:[Xu, Renyu; Wu, Jianliang; Xu, Jin] Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
通讯作者:Wu, Jianliang
通讯作者地址:[Wu, JL]Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
来源:JOURNAL OF COMBINATORIAL OPTIMIZATION
出版年:2016
卷:31
期:4
页码:1430-1442
DOI:10.1007/s10878-015-9832-7
关键词:Neighbor sum distinguishing total coloring; Euler characteristic;; Surface
摘要:A total coloring of a graph is a coloring of its vertices and edges such that adjacent or incident vertices and edges are not colored with the same color. A total -coloring of a graph is a total coloring of by using the color set . Let denote the sum of the colors of a vertex and the colors of all incident edges of . A total -neighbor sum distinguishing-coloring of is a total -coloring of such that for each edge , . Let be a graph which can be embedded in a surface of nonnegative Euler characteristic. In this paper, it is proved that the total neighbor sum distinguishing chromatic number of is if , where is the maximum degree of .
收录类别:EI;SCOPUS;SCIE
WOS核心被引频次:1
Scopus被引频次:1
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961322510&doi=10.1007%2fs10878-015-9832-7&partnerID=40&md5=40cd6aeb08c8eb8d6c6e2ca9c3fd3f5a
TOP