| 一类Pm×Cn图的邻点强可区别全染色 |
| |
| 引用本文： | 郭旭卫,马刚,马少仙.一类Pm×Cn图的邻点强可区别全染色[J].贵州大学学报(自然科学版),2009,26(2):24-26. |
| |
| 作者姓名： | 郭旭卫 马刚 马少仙 |
| |
| 作者单位： | 西北民族大学计算机科学与信息工程学院,甘肃,兰州,730030 |
| |
| 基金项目： | 西北民族大学中青年科研基金，国家民委科研基金 |
| |
| 摘 要： | 图的一个正常的全染色满足相邻点的点及其关联边染色的色集不同时，称为邻点强可区别全染色，其所用最少染色数称为邻点强可区别全色数。经证明得到了一类积图Pm×Cn的邻点强可区别色数。
|
| 关 键 词： | 积图 邻点强可区别的全染色法 邻点强可区别的全色数 |
On Adjacent Strong Vertex-Distinguishing Total Coloring of Pm×Cn |
| |
| GUO Xu-wei,MA Gang,MA Shao-xian.On Adjacent Strong Vertex-Distinguishing Total Coloring of Pm×Cn[J].Journal of Guizhou University(Natural Science),2009,26(2):24-26. |
| |
| Authors: | GUO Xu-wei MA Gang MA Shao-xian |
| |
| Institution: | College of Computer science and information engineering;Northwest University for Nationalities;Lanzhou 730030;China |
| |
| Abstract: | A total-coloring of a graph is called adjacent strong vertex-distinguishing if any two adjacent vertices are incident to different sets of colored vertex and incident edge with vertex . The minimum number of colors which were required for a adjacent vertex-distinguishing proper total coloring is called the adjacent strong vertex- distinguishing total chromatic number. The adjacent strong vertex distinguishing total chromatic number of Pm×Cn were given in this paper. |
| |
| Keywords: | product graph adjacent strong vertex-distinguishing total coloring adjacent strong vertex distinguishing total coloring |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
