吉林大学学报(理学版)

• 数学 • 上一篇    下一篇

D(d)-VDTC猜想的反例

陈祥恩, 何玉萍   

  1. 西北师范大学 数学与统计学院, 兰州 730070
  • 收稿日期:2015-06-18 出版日期:2016-01-26 发布日期:2016-01-19
  • 通讯作者: 陈祥恩 E-mail:chenxe@nwnu.edu.cn

Some Counterexamples to D(d)-VDTC Conjecture

CHEN Xiang’en, HE Yuping   

  1. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China
  • Received:2015-06-18 Online:2016-01-26 Published:2016-01-19
  • Contact: CHEN Xiang’en E-mail:chenxe@nwnu.edu.cn

摘要:

利用反证法及组合分析法, 得到一些更一般的D(d)-VDTC猜想的反例, 进一步说明了图的D(d)-点可区别全色数与其平凡下界之差可以超过任意正整数.

关键词: 全染色, D(d)-点可区别全染色, D(d)-点可区别全色数, 圈, 循环图

Abstract:

More general counterexamples to D(d)-VDTC conjecture were obtained by means of reduction to absurdity and the method of combinatorial analysis. These examples also show that the difference between D(d)-vertex distinguishing total chromatic number and its trivial lower bound may exceed arbitrary positive integer.

Key words: total coloring, D(d)-vertex distinguishing total coloring, D(d)-vertex distinguishing total chromatic number, cycle, circulant graph

中图分类号: 

  • O157.5