| mK的点可区别全染色mK的点可区别全染色 |
| |
| 引用本文： | 陈祥恩,王治文,马彦荣,姚兵.mK的点可区别全染色mK的点可区别全染色[J].吉林大学学报(理学版),2012,50(4):686-692. |
| |
| 作者姓名： | 陈祥恩 王治文 马彦荣 姚兵 |
| |
| 作者单位： | 1. 西北师范大学 数学与信息科学学院, 兰州 730070,2. 宁夏大学 数学计算机学院, 银川 750021 |
| |
| 基金项目： | 国家自然科学基金，宁夏自然基金，宁夏大学科学研究基金 |
| |
| 摘 要： | 利用色集事先分配法, 借助于矩阵构造具体染色及递归法的方法, 研究图的点可区别全染色问题, 给出了m个K4的点不交的并mK4的点可区别全色数χvt(mK4)的确切值, 即“如果k-14<4m≤k4, m≥2, k≥6, 则χvt(mK4)=k”. 验证了VDTC猜想对mK4成立.
|
| 关 键 词： | ,图,点可区别全染色,点可区别全色数, |
| 收稿时间： | 2011-09-22 |
Vertex-Distinguishing Total Colorings of mK4 |
| |
| CHEN Xiang-en
,
WANG Zhi-wen
,
MA Yan-rong
,
YAO Bing.Vertex-Distinguishing Total Colorings of mK4[J].Journal of Jilin University: Sci Ed,2012,50(4):686-692. |
| |
| Authors: | CHEN Xiang-en WANG Zhi-wen MA Yan-rong YAO Bing |
| |
| Institution: | 1. College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China;
2. School of Mathematics and Computer Science, Ningxia University, Yinchuan 750021, China |
| |
| Abstract: | The problem of vertex-distinguishing total colorings of graphs was discussed via the methods of distributing color sets in advance,constructing concrete coloring with the help of matrices and recurrence method.The exact value of the vertex-distinguishing total chromatic number χvt(mK4) of the union mK4 of m vertex-disjoint K4 was given,that is "If (k-1 4)<4m≤(k 4),m≥2,k≥6,then χvt(mK4)=k".This illustrates that the VDTC conjecture is valid for mK4. |
| |
| Keywords: | graphs vertex-distinguishing total coloring vertex-distinguishing total chromatic number |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文 |
|
