| 与T(1,1,n)的补图有相同色划分的图 |
| |
| 引用本文： | 王波.与T(1,1,n)的补图有相同色划分的图[J].温州大学学报(自然科学版),2007,28(1):5-9. |
| |
| 作者姓名： | 王波 |
| |
| 作者单位： | 青海师范大学数学系,青海西宁,810008 |
| |
| 摘 要： | 应用图的伴随多项式理论完整地刻画了与T(1,1,n)的补图有相同色划分的图,其中T(l1,l2,l3)表示只有一个3度点,三个1度点,且唯一3度点到三个1度点的距离分别为l1,l2,l3的n阶树.
|
| 关 键 词： | 色划分 色等价 最小根 |
| 文章编号： | 1006-0375(2007)01-0002-05 |
| 修稿时间： | 2006年9月4日 |
The Graphs with the Same Chromatic Partitions as the Complement of T(1,1,n) |
| |
| WANG Bo.The Graphs with the Same Chromatic Partitions as the Complement of T(1,1,n)[J].Journal of Wenzhou University Natural Science,2007,28(1):5-9. |
| |
| Authors: | WANG Bo |
| |
| Abstract: | Let T(l1,l2,l3) be a tree with vertex of degree 3 and three vertices of degree 1 in which the distances from the vertex of degree 3 to the degree 1 are l1,l2,l3 respectively.By using the theory of adjoint polynomials,it completely characterizes all graphs having the same chromatically equivalent classification with the complement of T(1,1,n). |
| |
| Keywords: | Color-partition Chromatically equivalent Minimum root |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
