| 若干图的强染色 |
| |
| 引用本文： | 刘景发,黄文奇.若干图的强染色[J].经济数学,2004,21(1):78-82. |
| |
| 作者姓名： | 刘景发 黄文奇 |
| |
| 作者单位： | 1. 华中科技大学计算机科学与技术学院,武汉,430074;衡阳师范学院数学系,衡阳,421008
2. 衡阳师范学院数学系,衡阳,421008 |
| |
| 基金项目： | This Reseach is supported by the fund of the Hunan Educational office (N O:0 2 C1 33) |
| |
| 摘 要： | 图 G(V,E)的一正常 k-染色 σ称为 G(V,E)的 - k-强染色当且仅当对任何两个不同顶点 u和 v,只要d(u,v)≤ 2 ,则 u、v染不同颜色 (这里 d(u,v)表示 u,v之间的距离 ) ,并称 xs(G) =min{ k|存在 G的 - k-强染色 }为 G的强色数 ,本文得到 θ-图 ,Cm,n图 ,Halin图的强色数 xs(G)
|
| 关 键 词： | 强染色 强色数 Halin图 |
ON THE STRONG COLORING OF SOME GRAPHS |
| |
| Liu Jingfa,Huang Wenqi.ON THE STRONG COLORING OF SOME GRAPHS[J].Mathematics in Economics,2004,21(1):78-82. |
| |
| Authors: | Liu Jingfa Huang Wenqi |
| |
| Institution: | Liu Jing fa 1,2 Huang Wenqi 2 |
| |
| Abstract: | A proper k-coloring σ of graph G(V,E) is said to be a k-strong coloring of G(V,E) iff for any two vertices u and v with d(u,v)≤2 have distinct colors,where d(u,v) denotes the distance between the vertices u and v,and xs(G)=min{k |k-strong coloring of G}is called the strong chromatic number of G. In this paper,we obtained some results about xs(G) of θ-graph. C graph, Halin graph. |
| |
| Keywords: | Strong coloring strong chromatic number Halin graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
