| 图的邻点强可区别的EI-全染色 |
| |
| 引用本文： | 程辉,王志勇.图的邻点强可区别的EI-全染色[J].山东大学学报(理学版),2010,45(6):18-22. |
| |
| 作者姓名： | 程辉 王志勇 |
| |
| 作者单位： | 西北师范大学数学与信息科学学院,甘肃兰州,730070 |
| |
| 基金项目： | 国家自然科学基金资助项目 |
| |
| 摘 要： | 提出了图的邻点强可区别的EI-全染色的概念,研究了它的一些性质,得到了路,扇,轮,圈,完全二部图,完全图,树,Petersen图的邻点强可区别的EI-全色数。
|
| 关 键 词： | 邻点可区别全染色 邻点强可区别的全染色 邻点强可区别的EI-全染色 |
| 收稿时间： | 2009-09-14 |
The adjacent vertex strongly distinguishing EI-total colorings of graphs |
| |
| CHENG Hui,WANG Zhi-yong.The adjacent vertex strongly distinguishing EI-total colorings of graphs[J].Journal of Shandong University,2010,45(6):18-22. |
| |
| Authors: | CHENG Hui WANG Zhi-yong |
| |
| Institution: | College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, Gansu, China |
| |
| Abstract: | The concept of adjacent vertex strongly distinguishing EI-total coloring of graph is proposed. Some properties and the adjacent vertex strongly distinguishing EI-total chromatic numbers of some graphs, such as Path, Fan, Wheel, Cycle, Complete bipartite graph, Complete graph,Tree, Petersen graph, are investigated. |
| |
| Keywords: | adjacent vertex distinguishing total coloring adjacent vertex strongly distinguishing total coloring adjacent vertex strongly distinguishing EI-total coloring |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《山东大学学报(理学版)》下载免费的PDF全文 |
|
