| Total Chromatic Number of the Join of K_(m,n) and C_n |
| |
| 作者姓名： | LI Guang-rong ZHANG Li-min |
| |
| 作者单位： | College of Information Engineering，Information Engineering Institute，Zhengzhou 450002，China |
| |
| 摘 要： | The total chromatic number XT(G) of a graph G is the minimum number of colors needed to color the elements (vertices and edges) of G such that no adjacent or incident pair of elements receive the same color. G is called Type 1 if XT(G)=Δ(G) 1. In this paper we prove that the join of a complete bipartite graph Km,n and a cycle Cn is of Type 1.
|
| 关 键 词： | 总彩色数 连接图 周期 完全双向图 图论 |
Total Chromatic Number of the Join of Km,n and Cn |
| |
| LI Guang-rong,ZHANG Li-min.Total Chromatic Number of the Join of K_(m,n) and C_n[J].Chinese Quarterly Journal of Mathematics,2006,21(2):264-270. |
| |
| Authors: | LI Guang-rong ZHANG Li-min |
| |
| Institution: | College of Information Engineering, Information Engineering Institute, Zhengzhou 450002, China |
| |
| Abstract: | |
| |
| Keywords: | total coloring total chromatic number join graphs cycle complete bipartite graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
