| γ-klee-图的Hamilton-连通性和着色 |
| |
| 引用本文： | 魏首柳,王艳.γ-klee-图的Hamilton-连通性和着色[J].数学研究,2013(2):134-141. |
| |
| 作者姓名： | 魏首柳 王艳 |
| |
| 作者单位： | [1]厦门大学数学科学学院,福建厦门361005 [2]闽江学院数学系,福建福州350108 [3]闽南师范大学数学与统计学院,福建漳州363000 |
| |
| 基金项目： | supported by NSFC（11171279）; the Scientific Research Fund of Minnan Normal University（SX1002） |
| |
| 摘 要： | 一个r-klee-图递归定义为一个r＋1阶完全图或者通过用一个r阶完全图替换已知的r-klee-图G′中的一个顶点所得到的图.本文主要研究了r-klee-图的Hamilton-连通性和着色问题.我们证明了：每一个r-klee-图是Hamilton-连通的和它的色数是r;如果r是奇数,则它的边色数是r;如果r是偶数,则它的边色数是r＋1.
|
| 关 键 词： | γ-klee-图 Hamilton-连通 色数 边色数 |
The Hamilton-connectivity and the Coloring of r-klee-graphs |
| |
| Wei Shouliu Wang Yan.The Hamilton-connectivity and the Coloring of r-klee-graphs[J].Journal of Mathematical Study,2013(2):134-141. |
| |
| Authors: | Wei Shouliu Wang Yan |
| |
| Institution: | Wei Shouliu Wang Yan (1. School of Mathematical Sciences, Xiamen University, Xiamen Fujian 361005 2. Department of Mathematics, Minjiang University, Fuzhou Fujian 350108 3. School of Mathematics and Statistics, Minnan Normal University, zhangzhou Fujian 363000) |
| |
| Abstract: | An τ-klee-graph is inductively defined as being either Kτ＋1, or the graph obtained from an τ-klee-graph by replacing a vertex by Kτ, the complete graph with r vertices. In this paper, we consider the Hamilton-connectivity and the coloring problem of r-klee-graphs. It is shown that every τ-klee-graph is Hamilton-connected and its chromatic number is r. Furthermore, we prove that the edge chromatic number of every τ-klee-graph is r if r is odd and r 4- 1 if r is even. |
| |
| Keywords: | τ-klee-graph Hamilton-connected Chromatic number Edge chromatic number |
| 本文献已被 维普 等数据库收录！ |
