期刊文献+

mC_7的点可区别全染色 被引量:1

Vertex-Distinguishing Total Coloring of mC_7
下载PDF
导出
摘要 考虑m个长为7的圈点不交的并mC7的点可区别全染色问题.通过构造以色集合为元素的矩阵,利用色集合事先分配法及递归法确定染色,得出了mC_7的点可区别全色数的确切值.结果表明VDTC猜想对图mC_7成立. We considered the problem of the vertex-distinguishing total colorings of the disjoint union mC7 of m cycles of length 7. By constructing a matrix which was composed of color sets as elements, the vertex distinguishing total coloring of raG7 was determined by using the methods of distributing color sets in advance and induction. We obtained the exact value of vertex-distinguishing total chromatic number of rnCT. The results show that the VDTC conjecture is valid for taCT.
出处 《吉林大学学报(理学版)》 CAS CSCD 北大核心 2017年第3期531-536,共6页 Journal of Jilin University:Science Edition
基金 国家自然科学基金(批准号:61163037 61163054 11261046) 宁夏回族自治区百人计划资助项目
关键词 图的并 点可区别全染色 点可区别全色数 cycle union of graphs vertex-distinguishing total coloring vertex-distinguishing totalchromatic number
  • 相关文献

参考文献3

二级参考文献17

  • 1ZHANG Zhongfu,LI Jingwen,CHEN Xiang’en,YAO Bing, WANG Wenjie & QIU Pengxiang Institute of Applied Mathematic, Lanzhou Jiaotong University, Lanzhou 730070, China,College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China,College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China.D(β)-vertex-distinguishing total coloring of graphs[J].Science China Mathematics,2006,49(10):1430-1440. 被引量:56
  • 2ZHANG Zhongfu, CHEN Xiang’en, LI Jingwen, YAO Bing, LU Xinzhong & WANG Jianfang College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China,Department of Computer, Lanzhou Normal College, Lanzhou 730070, China,Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China,College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China,Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China.On adjacent-vertex-distinguishing total coloring of graphs[J].Science China Mathematics,2005,48(3):289-299. 被引量:175
  • 3陈祥恩.n-方体的点可区别全色数的渐近性态[J].西北师范大学学报(自然科学版),2005,41(5):1-3. 被引量:16
  • 4安明强,刘信生,陈祥恩.关于几类特殊图的Mycielski图的点可区别全色数[J].西北师范大学学报(自然科学版),2005,41(5):4-7. 被引量:3
  • 5ZHANG Zhongfu, QIU Pengxiang, XU Baogen, et al. Vertex-distinguishing total colorings of graphs [ J]. Ars Combinatoria, 2008, 87:33-45.
  • 6BURRIS A C, SCHELP R H. Vertex-distinguishing proper edge-colorings[J]. Journal of Graph Theory, 1997, 26(2): 73-82.
  • 7BALISTER P N, BOLLOBAs B, SCHELP R H. Vertex distinguishing colorings of graphs with lleG) = 2[J]. Discrete Mathematics, 2002, 252: 17-29.
  • 8ZHANG Zhong-fu, QIU Peng-xiang, XU Bao-gen, et al. Vertex-distinguishing total colorings of graphs[J]. Ars Combinatoric, 2008, 87: 33-45.
  • 9CHEN Xiang-en. Asymptotic behavior of the vertex-distinguishing total chromatic numbers of n-cube[J]. Journal of Northwest Normal University(Natural Science), 2005, 41(5): 1-3.
  • 10刘利群,陈祥恩.路和圈上的锥的D(2)-点可区别正常边染色[J].山东大学学报(理学版),2008,43(2):87-97. 被引量:14

共引文献23

同被引文献15

引证文献1

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部