| 若干联图的均匀全染色 |
| |
| 引用本文： | 龚坤,张忠辅,王建方. 若干联图的均匀全染色[J]. 数学研究及应用, 2008, 28(4): 823-828 |
| |
| 作者姓名： | 龚坤 张忠辅 王建方 |
| |
| 作者单位： | 中国科学院数学与系统科学研究院应用数学研究所, 北京 100080; 中国科学院研究生院, 北京 100080;兰州交通大学应用数学研究所 甘肃 兰州 730070; 西北师范大学应用数学系, 甘肃 兰州 730070;中国科学院数学与系统科学研究院应用数学研究所, 北京 100080; |
| |
| 基金项目： | 国家自然科学基金(No.10771091). |
| |
| 摘 要： | 图$G(V,E)$的全色数 $chi_{t}(G)$就是将$Vbigcup E$分成彼此不相交的全独立分割集的最小个数。 如果任何两个$Vbigcup E$的全独立分割集的元素数目相差不超过1，那么 $V bigcup E$的全独立分割集的最小个数就称为图$G$的均匀全色数，记为$chi_{et}(G)$。 在本文中我们给出了当 $m geq n geq 3$ 时 $W_mbigvee K_n$，$F_m bigvee K_n$及$S_m bigvee K_n$ 的均匀全色数.
|
| 关 键 词： | 均匀全染色 均匀全色数 联图 均匀边染色. |
| 收稿时间： | 2006-11-13 |
| 修稿时间： | 2007-03-23 |
Equitable Total Coloring of Some Join Graphs |
| |
| GONG Kun,ZHANG Zhong Fu and WANG Jian Fang. Equitable Total Coloring of Some Join Graphs[J]. Journal of Mathematical Research with Applications, 2008, 28(4): 823-828 |
| |
| Authors: | GONG Kun ZHANG Zhong Fu WANG Jian Fang |
| |
| Affiliation: | Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China; Graduate School of the Chinese Academy of Sciences, Beijing 100080, China;Institute of Applied Mathematics, Lanzhou Jiaotong University, Gansu 730070, China; Department of Applied Mathematics, Northwest Normal University, Gansu 730070, China;Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China; |
| |
| Abstract: | The total chromatic number $chi_{t}(G)$ of a graph $G(V,E)$ is the minimum number of total independent partition sets of $V bigcup E$, satisfying that any two sets have no common element. If the difference of the numbers of any two total independent partition sets of $V bigcup E$ is no more than one, then the minimum number of total independent partition sets of $V bigcup E$ is called the equitable total chromatic number of $G$, denoted by $chi_{et}(G)$. In this paper, we have obtained the equitable total chromatic number of $W_m bigvee K_n$, $F_m bigvee K_n$ and $S_m bigvee K_n$ while $m geq n geq 3$. |
| |
| Keywords: | equitable total coloring equitable total chromatic number join graph equitable edge coloring. |
|
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
|
点击此处可从《数学研究及应用》下载全文 |
|
