| 若干联图的邻点可区别全染色 |
| |
| 引用本文： | 田双亮. 若干联图的邻点可区别全染色[J]. 西北民族学院学报, 2006, 27(1): 5-7 |
| |
| 作者姓名： | 田双亮 |
| |
| 作者单位： | 西北民族大学计算机科学与信息工程学院 甘肃兰州730030 |
| |
| 摘 要： | 研究若干联图的邻点可区别全染色,证明了:当n≥3时,χat(Kn∨Cn)=χat(Kn∨Pn)=2n+1;当n≥4时,χat(Kn∨Wn?1)=χat(Kn∨Fn?1)=χat(Kn∨Sn?1)=2n+1.
|
| 关 键 词： | 完全图 联图 邻点可区别全染色 邻点可区别全色数 |
| 文章编号： | 1009-2102(2006)01-0005-03 |
| 修稿时间： | 2006-01-10 |
On the Adjacent Vertex-Distinguishing Total Coloring of Some Join Graphs |
| |
| TIAN Shuang-liang. On the Adjacent Vertex-Distinguishing Total Coloring of Some Join Graphs[J]. Journal of Northwest Minorities University(Natural Science ), 2006, 27(1): 5-7 |
| |
| Authors: | TIAN Shuang-liang |
| |
| Abstract: | The adjacent vertex-distinguishing total chromatic number of some join graphs are studied. It has been proved that if n ≥3, then χ at ( K n∨ Cn)=χat(Kn∨Pn)=2n+1, and if n ≥4, then χ at ( K n∨ Wn?1 )=χat(Kn∨Fn?1)=χat(Kn∨Sn?1)=2n+1. |
| |
| Keywords: | complete graph the join of two graphs adjacent vertex-distinguishing total Coloring adjacent-vertex-distinguishing total chromatic number. |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
