| 两类循环图的均匀色数 |
| |
| 引用本文： | 朱俊蕾.两类循环图的均匀色数[J].嘉兴学院学报,2011,23(3):31-35. |
| |
| 作者姓名： | 朱俊蕾 |
| |
| 作者单位： | 嘉兴学院数理与信息工程学院,浙江,嘉兴,314001 |
| |
| 摘 要： | 图G（V,E）的k-染色称为G（V,E）的k-均匀染色,当且仅当任意两个色类中的元素总数至多相差1.χe（G）=m in{k｜图G有k-均匀染色}称为G的均匀色数,计算了循环图Cn（1,2,…,5）和Cn（1,2,…,6）的均匀色数.
|
| 关 键 词： | 均匀染色 均匀色数 循环图 |
The Equitable Chromatic Numbers of Two Types of Circulant Graphs |
| |
| ZHU Jun-lei.The Equitable Chromatic Numbers of Two Types of Circulant Graphs[J].Journal of Jiaxing College,2011,23(3):31-35. |
| |
| Authors: | ZHU Jun-lei |
| |
| Institution: | ZHU Jun-lei (School of Mathematics,Physics and Information Engineering,Jiaxing University,Jiaxing,Zhejiang 314001) |
| |
| Abstract: | A graph G is equitably k-colorable if G has a proper kvertex coloring such that the sizes of any two color classes differ by at most 1.The smallest integer k for which G is equitably k-colorable is called the equitable chromatic number of G,denoted by χe（G）.In this paper,the author calculates the equitable chromatic number of circulant graphs Cn（1,2,…,5） and Cn（1,2,…,6）. |
| |
| Keywords: | equitable staining equitable chromatic number circulant graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
