| 关于多重联图的均匀全染色 |
| |
| 引用本文： | 马刚,张忠辅.关于多重联图的均匀全染色[J].数学研究及应用,2007,27(2):351-354. |
| |
| 作者姓名： | 马刚 张忠辅 |
| |
| 作者单位： | 1. 西北民族大学计算机科学与信息工程学院,甘肃,兰州,730030
2. 兰州交通大学应用数学研究所,甘肃,兰州,730070 |
| |
| 基金项目： | 国家自然科学基金;国家民委科研项目 |
| |
| 摘 要： | 对一个正常的全染色满足各种颜色所染元素数(点或边)相差不超过1时,称为均匀全染色,其所用最少染色数称为均匀全色数．本文证明了关于多重联图的若干情况下的均匀全色数定理,得到了若干特殊多重联图的均匀全色数．
|
| 关 键 词： | 联图 均匀全染色 均匀全色数 |
| 文章编号： | 1000-341X(2007)02-0351-04 |
| 收稿时间： | 2005/11/24 0:00:00 |
| 修稿时间： | 11 24 2005 12:00AM |
On the Equitable Total Coloring of Multiple Join-Graph |
| |
| MA Gang and ZHANG Zhong-fu.On the Equitable Total Coloring of Multiple Join-Graph[J].Journal of Mathematical Research with Applications,2007,27(2):351-354. |
| |
| Authors: | MA Gang and ZHANG Zhong-fu |
| |
| Institution: | College of Computer Science and Information Engineering, Northwest University for Nationalities, Gansu 730030, China;Institute of Applied Mathematics, Lanzhou Jiaotong University, Gansu 730070, China |
| |
| Abstract: | A total-coloring is called equitable if $| \mid S_{i}\mid-\mid S_{j}\mid |\leq 1$, where $\mid S_{i}\mid$ is the chromatic number of the color. The minimum number of colors required for an equitable proper total-coloring. A simple graph $G$ is denoted by $\chi_{et}(G)$. In this paper, we prove theorems of equitable total coloring of multiple join-graph and get equitable total chromatic numbers of some special multiple join-graph. |
| |
| Keywords: | join-graph equitable total coloring equitable total chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
| 点击此处可从《数学研究及应用》下载免费的PDF全文 |
