| 关于图K2n+1-E(2 K2)的邻点可区别全色数 |
| |
| 引用本文： | 陈祥恩,张忠辅. 关于图K2n+1-E(2 K2)的邻点可区别全色数[J]. 兰州大学学报(自然科学版), 2005, 41(6): 102-105 |
| |
| 作者姓名： | 陈祥恩 张忠辅 |
| |
| 作者单位： | 西北师范大学,数学与信息科学学院,甘肃,兰州,730070;西北师范大学,数学与信息科学学院,甘肃,兰州,730070;兰州交通大学应用数学研究所,甘肃,兰州,730070 |
| |
| 摘 要： | 用K2n 1-E(2K2)表示2n 1阶的完全图删掉两条不相邻的边所得到的图,给出了图K2n 1-E(2K2)的邻点可区别全色数.
|
| 关 键 词： | 图 全染色 邻点可区别全染色 邻点可区别全色数 |
| 文章编号： | 0455-2059（2005）06-0102-04 |
| 收稿时间： | 2004-02-17 |
| 修稿时间： | 2004-02-17 |
Adjacent-vertex-distinguishing total chromatic numbers of K2n+1- E(2K2) |
| |
| CHEN Xiang-en,ZHANG Zhong-fu. Adjacent-vertex-distinguishing total chromatic numbers of K2n+1- E(2K2)[J]. Journal of Lanzhou University(Natural Science), 2005, 41(6): 102-105 |
| |
| Authors: | CHEN Xiang-en ZHANG Zhong-fu |
| |
| Affiliation: | 1. College of Mathematics and Information Science, Northwest Normal University, Lanzhou, 730070, China; 2. Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou, 730070, China |
| |
| Abstract: | Let K2n+1 - E(2K2) be a graph obtained by deleting two nonadjacent edges from the complete graph K2n+1. The adjacent-vertex-distinguishing total chromatic numbers of K2n+1 - E(2K2) are discussed in this paper. |
| |
| Keywords: | graph total coloring adjacent-vertex-distinguishing total coloring adjacent-vertex-distinguishing total chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
