neighborsumdistinguishingtotalcoloringsviathecombinatorialnullstellensatz
文献类型：期刊论文
| 作者 | Ding Laihao1; Wang Guanghui1; Yan Guiying2
|
| 刊名 | sciencechinamathematics
 |
| 出版日期 | 2014 |
| 卷号 | 57期号:9页码:1875 |
| ISSN号 | 1674-7283 |
| 英文摘要 | Let G = (V E) be a graph and i be a total coloring of G by using the color set {1,2,...,k} Let f(v) denote the sum of the color of the vertex v and the colors of all incident edges of v. We say that phi is neighbor sum distinguishing if for each edge uv is an element of E(G), f(u) not equal f(v). The smallest number k is called the neighbor sum distinguishing total chromatic number, denoted by chi(nsd)''(G). Pilsniak and Wozniak conjectured that for any graph G with at least two vertices, chi(nsd)''(G) <= Delta(G) + 3. In this paper, by using the famous Combinatorial Nullstellensatz, we show that chi(nsd)''(G) <= 2 Delta (G) + col(G) - 1, where col(G) is the coloring number of G. Moreover, we prove this assertion in its list version. |
| 资助项目 | [National Natural Science Foundation of China] ; [Research Fund for the Doctoral Program of higher Education of China] ; [Scientific Research Foundation for the Excellent Middle Aged and Youth Scientists of Shandong Province of China] |
| 语种 | 英语 |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/37540]  |
| 专题 | 应用数学研究所 |
| 作者单位 | 1.山东大学 2.中国科学院数学与系统科学研究院 |
| 推荐引用方式 GB/T 7714 | Ding Laihao,Wang Guanghui,Yan Guiying. neighborsumdistinguishingtotalcoloringsviathecombinatorialnullstellensatz[J]. sciencechinamathematics,2014,57(9):1875. |
| APA | Ding Laihao,Wang Guanghui,&Yan Guiying.(2014).neighborsumdistinguishingtotalcoloringsviathecombinatorialnullstellensatz.sciencechinamathematics,57(9),1875. |
| MLA | Ding Laihao,et al."neighborsumdistinguishingtotalcoloringsviathecombinatorialnullstellensatz".sciencechinamathematics 57.9(2014):1875. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。