| 若干广义Petersen图的邻点可区别全染色 |
| |
| 引用本文： | 田双亮.若干广义Petersen图的邻点可区别全染色[J].山东大学学报(理学版),2008,43(9):42-44. |
| |
| 作者姓名： | 田双亮 |
| |
| 作者单位： | 西北民族大学计算机科学与信息工程学院,甘肃,兰州,730030 |
| |
| 摘 要： | 研究了若干广义Petersen图G(n,r)的邻点可区别全染色。 构造性地证明了:若n≡0(mod 4),r0(mod 4)或n≡0(mod 5),r0(mod 5),则G(n,r)的邻点可区别全色数为5。
|
| 关 键 词： | 广义Petersen图 圈 邻点可区别全染色 邻点可区别全色数 |
On the adjacent vertex-distinguishing total coloring of some generalized Petersen graphs |
| |
| TIAN Shuang-liang.On the adjacent vertex-distinguishing total coloring of some generalized Petersen graphs[J].Journal of Shandong University,2008,43(9):42-44. |
| |
| Authors: | TIAN Shuang-liang |
| |
| Institution: | Computer Science and Information Engineering College, Northwest University for Nationalities, Lanzhou 730030, Gansu, China |
| |
| Abstract: | The adjacent vertex-distinguishing total coloring of some generalized Petersen graphs G(n,r) were studied. It was constructively proved that if n≡0(mod 4), r0(mod 4) or n≡0(mod 5), r0(mod 5), then the adjacent vertex-distinguishing total chromatic number of G(n,r) is five. |
| |
| Keywords: | generalized Petersen graphs cycle adjacent vertex-distinguishing total coloring adjacent vertex-distinguishing total chromatic number |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《山东大学学报(理学版)》下载免费的PDF全文 |
