| 幂图的邻点可区别全色数和邻点可区别-VE全色数 |
| |
| 引用本文： | 田京京.幂图的邻点可区别全色数和邻点可区别-VE全色数[J].科学技术与工程,2010,10(15). |
| |
| 作者姓名： | 田京京 |
| |
| 作者单位： | 陕西理工学院数学系,汉中,723001 |
| |
| 基金项目： | 陕西省教育厅专项基金 |
| |
| 摘 要： | 根据路的幂图Pkn的结构性质,用穷染、递推的方法,讨论了Pkn的邻点可区别全染色和邻点可区别-VE全染色,得到了相应的色数,并给出了一种染色方案.
|
| 关 键 词： | 图 幂图 邻点可区别全染色 邻点可区别全色数 邻点可区别-VE全染色 邻点可区别-VE全色数 |
| 收稿时间： | 2/1/2010 1:04:08 PM |
| 修稿时间： | 4/9/2010 9:43:53 PM |
Adjacent Vertex-distinguishing Total Chromatic Number and Adjacent Vertex-distinguishing-VE Total Chromatic Number of the power graph |
| |
| tianjingjing.Adjacent Vertex-distinguishing Total Chromatic Number and Adjacent Vertex-distinguishing-VE Total Chromatic Number of the power graph[J].Science Technology and Engineering,2010,10(15). |
| |
| Authors: | tianjingjing |
| |
| Abstract: | According to the properties of power graph , the adjacent vertex distinguishing total coloring and the adjacent vertex distinguishing - VE total coloring of the power graph are discussed by using color one by one and recursion, the adjacent vertex distinguishing total chromatic numbehe and adjacent vertex distinguishing-VE total chromatic number of 2-power graph are obtained, the coloring method of the power graph are given |
| |
| Keywords: | graph the power graph adjacent vertex distinguishing total coloring adjacent vertex distinguishing chromatic number adjacent vertex distinguishing -VE total coloring adjacent vertex distinguishing -VE chromatic number |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《科学技术与工程》浏览原始摘要信息 |
| 点击此处可从《科学技术与工程》下载免费的PDF全文 |
