| 图C_m∨F_n的邻点可区别全染色 |
| |
| 引用本文： | 马刚,张炜,张忠辅.图C_m∨F_n的邻点可区别全染色[J].西北民族学院学报,2005,26(2):24-29. |
| |
| 作者姓名： | 马刚 张炜 张忠辅 |
| |
| 作者单位： | [1]西北民族大学计算机科学与信息工程学院,甘肃兰州730030 [2]兰州交通大学应用数学研究所,甘肃兰州730070 |
| |
| 基金项目： | 国家自然科学基金资助项目(19871036). |
| |
| 摘 要： | 对一个正常的全染色满足相邻点的点及其关联边染色的色集不同时,称为邻点可区别全染色,其所用最少染色数称为邻点可区别全色数.就圈Cm与扇Fn的联图Cm∨Fn,得到了在m,n不同取值情况下的邻点可区别全色数.
|
| 关 键 词： | 圈 扇 联图 邻点可区别全色数 |
| 文章编号： | 1009-2102(2005)02-0024-06 |
| 修稿时间： | 2004年12月10 |
On Adjacent Vertex Distinguishing Total Coloring of Cm∨Fn |
| |
| MA Gang,ZHANG Zhong-fu.On Adjacent Vertex Distinguishing Total Coloring of Cm∨Fn[J].Journal of Northwest Minorities University(Natural Science ),2005,26(2):24-29. |
| |
| Authors: | MA Gang ZHANG Zhong-fu |
| |
| Institution: | MA Gang1,ZHANG Zhong-fu1,2 |
| |
| Abstract: | A total-coloring is called adjacent vertex-distinguishing if every two adjacent vertices are incident to different sets of colored vertex and incident edge with vertex. The minimum number of colors required for an adjacent vertex-distinguishing proper total-coloring, a simple graph G is denoted by ., The adjacent vertex distinguishing total chromatic number of have been given in this paper. |
| |
| Keywords: | cycle fan join-graph adjacent vertex distinguishing total chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
