| 关于色唯一图的注记 |
| |
| 引用本文： | 李雪峰.关于色唯一图的注记[J].西安邮电学院学报,2005,10(2):135-136. |
| |
| 作者姓名： | 李雪峰 |
| |
| 作者单位： | 西安邮电学院,应用数理系,陕西,西安,710061 |
| |
| 摘 要： | 设P(G;λ)是图G的色多项式,如果对任意图H,当P(H;λ)=P(G;λ)时,都有H和G同构,则称图G是色唯一的。本文给出了由两个块H和K2构成的图G是色唯一的当且仅当H是色唯一点可迁的。
|
| 关 键 词： | 色唯一: 同构 :点可迁 |
| 文章编号： | 1007-3264(2005)02-0135-02 |
| 修稿时间： | 2004年12月29 |
A note on chromatic uniqueness of graphs |
| |
| LI Xue-feng.A note on chromatic uniqueness of graphs[J].Journal of Xi'an Institute of Posts and Telecommunications,2005,10(2):135-136. |
| |
| Authors: | LI Xue-feng |
| |
| Abstract: | let P( G ;λ) denote the chromatic polynoical of a graph G. A graph G is said to be chromatically unique if P(H;λ) = P(G;λ) implies H is isomorphic to G. In this paper, we proved that if the two blocks of a connected graph G are H and K2, then G is chromatically unique if and only if H is vertex-transitive and chromatically unique. |
| |
| Keywords: | chromatic uniqueness isomorphic vertex- transitive |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
