| 单圈图的2-距离色数 |
| |
| 引用本文： | 于兰兰. 单圈图的2-距离色数[J]. 甘肃科学学报, 2009, 21(3): 41-42 |
| |
| 作者姓名： | 于兰兰 |
| |
| 作者单位： | 西北师范大学,数学与信息科学学院,甘肃,兰州,730070 |
| |
| 基金项目： | 甘肃省自然科学基金资助项目 |
| |
| 摘 要： | 图G的2-距离染色是指正常的顶点染色，且任意距离不〉2的2个顶点着不同的颜色，研究了单圈图的2-距离染色，给出了单圈图的2-距离色数．
|
| 关 键 词： | 2-距离染色 2-距离色数 单圈图 |
The 2-distance Chromatic Number of Monocycle Graphs |
| |
| YU Lan-lan. The 2-distance Chromatic Number of Monocycle Graphs[J]. Journal of Gansu Sciences, 2009, 21(3): 41-42 |
| |
| Authors: | YU Lan-lan |
| |
| Affiliation: | YU Lan-lan(College of Mathematics and Information Science,Northwest Normal University,Lanzhou 730070,China) |
| |
| Abstract: | The 2-distance coloring of graph G is a proper vertex coloring such that not two vertices at distance less than of equal to 2 in G are assigned the same color.This paper studies the 2-distance coloring and obtained the 2-distance chromatic number of monocycle graphs. |
| |
| Keywords: | 2-distance coloring 2-distance chromatic number monocycle graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
