| C3m×C3n、C4m×C4n的邻点强可区别全染色及全色数 |
| |
| 引用本文： | 张效贤.C3m×C3n、C4m×C4n的邻点强可区别全染色及全色数[J].甘肃科学学报,2009,21(2):26-28. |
| |
| 作者姓名： | 张效贤 |
| |
| 作者单位： | 兰州城市学院,数学学院,甘肃,兰州,730070 |
| |
| 基金项目： | 甘肃省教育厅第二批科研基金 |
| |
| 摘 要： | 给出了图C3m×C3n、C4m×C4n的一种全染色方法，并证明了该染色是邻点强可区别的，从而得到了C3m×C3n、C4m×C4n的邻点强可区别的全色数：Хast（C3m×C3n）=6、Хast（C4m×C4n）=6．此结果尚未见其他文件报道．
|
| 关 键 词： | 邻点强可区别 全染色 全色数 |
On the Adjacent Strong Vertex-distinguishing Total Coloring and Total Coloring Number of C3m×C3n、C4m×C4n |
| |
| ZHANG Xiao-xian.On the Adjacent Strong Vertex-distinguishing Total Coloring and Total Coloring Number of C3m×C3n、C4m×C4n[J].Journal of Gansu Sciences,2009,21(2):26-28. |
| |
| Authors: | ZHANG Xiao-xian |
| |
| Institution: | ZHANG Xiao-xian (College of Mathematics,Lanzhou City University,Lanzhou 730070,China) |
| |
| Abstract: | A total coloring approach is given for C3m×C3n、C4m×C4n. graph and the adjacent strong vertexdistinguishing total coloring is proved. By the approach, the adjacent strong vertex-distinguishing total coloring of C3m×C3n、C4m×C4n. is obtained：Хast（C3m×C3n）=6、Хast（C4m×C4n）=6. The result has not been reported in other articles. |
| |
| Keywords: | adjacent strong vertex-distinguishing total-coloring total coloring number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
