γ-klee-图的Hamilton-连通性和着色(英文); The Hamilton-connectivity and the Coloring of γ-klee-graphs | |
魏首柳 ; 王艳 | |
2013-06-15 | |
关键词 | γ-klee-图 Hamilton-连通 色数 边色数 γ-klee-graph Hamilton-connected Chromatic number Edge chromatic number |
英文摘要 | 一个r-klEE-图递归定义为一个r+1阶完全图或者通过用一个r阶完全图替换已知的r-klEE-图g′中的一个顶点所得到的图.本文主要研究了r-klEE-图的HAMIlTOn-连通性和着色问题.我们证明了:每一个r-klEE-图是HAMIlTOn-连通的和它的色数是r;如果r是奇数,则它的边色数是r;如果r是偶数,则它的边色数是r+1.; An r-klee-graph is inductively defined as being either K_(r+1),or the graph obtained from an r-klee-graph by replacing a vertex by K_r,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 r-klee-graph is Hamilton-connected and its chromatic number is r.Furthermore,we prove that the edge chromatic number of every r-klee-graph is r if r is odd and r + 1 if r is even.; supportedbyNSFC(11171279); theScientificResearchFundofMinnanNormalUniversity(SX1002) |
语种 | zh_CN |
内容类型 | 期刊论文 |
源URL | [http://dspace.xmu.edu.cn/handle/2288/119845] ![]() |
专题 | 数学科学-已发表论文 |
推荐引用方式 GB/T 7714 | 魏首柳,王艳. γ-klee-图的Hamilton-连通性和着色(英文), The Hamilton-connectivity and the Coloring of γ-klee-graphs[J],2013. |
APA | 魏首柳,&王艳.(2013).γ-klee-图的Hamilton-连通性和着色(英文).. |
MLA | 魏首柳,et al."γ-klee-图的Hamilton-连通性和着色(英文)".(2013). |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论