| 一类树并的补图的色唯一性 |
| |
| 引用本文： | 王力工,刘儒英. 一类树并的补图的色唯一性[J]. 纯粹数学与应用数学, 2001, 17(2): 126-132，137 |
| |
| 作者姓名： | 王力工 刘儒英 |
| |
| 作者单位： | 1. 西北工业大学应用数学系,
2. 青海师范大学数学系, |
| |
| 摘 要： | 彻底解决了一类不可约树并的补图是色唯一的 ,并得到了一些图的伴随多项式的最小根的重要规律 .
|
| 关 键 词： | 伴随多项式 最小根 特征值 不可约图 色唯一图 |
| 文章编号： | 1008-5513(2001)02-0126-07 |
| 修稿时间： | 1999-09-03 |
On the chromatic uniqueness for the complement of the union of the irreducible t-shape trees |
| |
| WANG Li-Gong ,LIU Ru-ying. On the chromatic uniqueness for the complement of the union of the irreducible t-shape trees[J]. Pure and Applied Mathematics, 2001, 17(2): 126-132，137 |
| |
| Authors: | WANG Li-Gong LIU Ru-ying |
| |
| Affiliation: | WANG Li-Gong 1,LIU Ru-ying 2 |
| |
| Abstract: | Let T n(l 1,l 2,l 3) denotes a tree with exact three 1-valent vertices.Some important results of the least root about the adjoint polynomial of a graph are oblained.It is proved that the complement of the kind of trees union be chromatically unique under irreducible condition. |
| |
| Keywords: | the least root adjoint polynomial irreducible graph the largest eigenvalue of a graph chromatic unique graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
