| 中间图的邻点可区别全染色 |
| |
| 引用本文： | 陈纲,;赵科军.中间图的邻点可区别全染色[J].漳州师院学报,2009(2):10-14. |
| |
| 作者姓名： | 陈纲 ;赵科军 |
| |
| 作者单位： | [1]宁夏大学数学计算机学院,宁夏银川750021; [2]宁夏教育考试院,宁夏银川750004 |
| |
| 基金项目： | 宁夏大学科研基金资助项目（ZR200827） |
| |
| 摘 要： | 设G是简单连通图，G的庀．正常全染色f称为是邻点可区别的，如果对G的任意相邻的两顶点，其点的颜色及关联边的颜色构成的集合不同，称f为G的k-邻点可区别全染色．这样的后中最小者称为G的邻点可区别全色数．本文考虑了图的中间图的邻点可区别全色数，并确定了路、圈、星图和扇图的中间图的邻点可区别全色数．
|
| 关 键 词： | 正常全染色 邻点可区别全染色 邻点可区别全染色数 中间图 |
Adjacent Vertex Distinguishing Total Coloring on the Middle Graphs |
| |
| Institution: | CHEN Gang , ZHAO Ke-jun (1. College of Mathematics and Computer, Ningxia University, Yinchuan, Ningxia 750021, China; 2. Ningxia Educational Examinations Authority, Yinchuan, Ningxia 750004, Chiua) |
| |
| Abstract: | Let G be a simple connected graph..A If-proper total coloring of G is called adjacent distinguishing if for arbitrary two adjacent vertices u and v, C（u） ≠ C（v）, where C（u） is the set of the colors of u and edges which is adjacent to u. The minimum If such that G has a k -adjacent-vertex-distinguishing total coloring is called the adjacent vertex distinguishing total chromatic number. The adjacent vertex distinguishing total chromatic number is obtained for the middle graphs of path, cycle, star and fan graph. |
| |
| Keywords: | proper-total-coloring adjacent-vertex-distinguishing total coloring adjacent-vertex-distinguishing total chromatic number middle graph |
| 本文献已被 维普 等数据库收录！ |
|
