| 两类积图的邻点可区别全染色 |
| |
| 引用本文： | 田双亮,陈萍. 两类积图的邻点可区别全染色[J]. 数学研究及应用, 2007, 27(4): 733-737 |
| |
| 作者姓名： | 田双亮 陈萍 |
| |
| 作者单位： | 1. 西北民族大学数学系,甘肃,兰州,730030
2. 西北民族大学经济管理学院,甘肃,兰州,730030 |
| |
| 摘 要： | 本文.证明了,当n≥2时,Xat(K_n×K′_n)=2n;当p,q≥2时,Xat(C_(2p)×K_(2q))=2q 3,其中K_n×K′_n是两个不同标号完全图的积图,C_(2p)×K_(2q)是偶圈和偶阶完全图的积图.
|
| 关 键 词： | 积图 邻点可区别全染色 邻点可区别全色数. |
| 文章编号： | 1000-341X（2007）04-0733-05 |
| 收稿时间： | 2004-12-28 |
| 修稿时间： | 2004-12-28 |
On the Adjacent Vertex-Distinguishing Total Coloring of Two Classes of Product Graphs |
| |
| TIAN Shuang-liang and CHEN Ping. On the Adjacent Vertex-Distinguishing Total Coloring of Two Classes of Product Graphs[J]. Journal of Mathematical Research with Applications, 2007, 27(4): 733-737 |
| |
| Authors: | TIAN Shuang-liang and CHEN Ping |
| |
| Affiliation: | Department of Mathematics, Northwest Minorities University, Gansu 730030, China;College of Economics and Management, Northwest Minorities University, Gansu 730030, China |
| |
| Abstract: | It is proved that if $ ngeq2$, then $chi_{at}(K_ntimes K'_n)=2n$, and if $ p,,qgeq2$, then $chi_{at}(C_{2p}times K_{2q})=2q+3$, where $K_ntimes K'_n$ is the product of two complete graphs with different labels, and $C_{2p}times K_{2q}$ is the product of an even cycle and a complete graph of even order. |
| |
| Keywords: | product graphs adjacent vertex-distinguishing total coloring adjacent vertex-distinguishing total chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
|
点击此处可从《数学研究及应用》下载全文 |
|
