| 一类5—桥图的色唯一性 |
| |
| 引用本文： | 李雪峰,魏暹荪.一类5—桥图的色唯一性[J].青海师范大学学报(自然科学版),2001,642(2):12-17. |
| |
| 作者姓名： | 李雪峰 魏暹荪 |
| |
| 作者单位： | 陕西师范大学数学系, |
| |
| 摘 要： | 设P(G;λ）是图G关于变量λ的色多项式。如果对任意图H，P（H；λ）＝P（G；λ），都有H和G同构，则称图G是色唯一的，由连接两个顶点的s条内部不交的路组成的图叫s-桥图，本文给出了一类5-桥图F（2，2，2，a,b)(a≥b≥3)是色唯一的充分必要条件，推广了关于5－ 图色唯一性的已有结论。λ
|
| 关 键 词： | 广义多边形树 5－桥图 色等价 色唯一 |
| 文章编号： | 1001-7542(2001)02-0012-06 |
| 修稿时间： | 2000年11月5日 |
The chromatic uniqueness of a family of 5-bridge graphs |
| |
| LI Xue-feng,WEI Xian-sun.The chromatic uniqueness of a family of 5-bridge graphs[J].Journal of Qinghai Normal University(Natural Science Edition),2001,642(2):12-17. |
| |
| Authors: | LI Xue-feng WEI Xian-sun |
| |
| Abstract: | let P(G;λ)denote the chromatic polynomial of a graph G,expressed in the variable λ.Two graph G and H are said to be chromatically equivalent if P(G)=P(H).A graph G is said to be chromatically unique if P(G)=P(H)implies H is isomorphic to G.The graph consisting of s paths joining two vertices is called a s-bridge graph.In this paper,we give the sufficient and necessary conditions for a family of 5-bridge graph to be chromatically unique and generalize certain results about the chromatic uniqueness of 5-bridge graphs which have been obtained. |
| |
| Keywords: | generalized polygon tree 5-bridge graphs chromatic equivalence chromatic uniqueness |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
