节点文献
与T(1,1,n)的补图有相同色划分的图
The Graphs with the Same Chromatic Partitions as the Complement of T(1,1,n)
【摘要】 应用图的伴随多项式理论完整地刻画了与T(1,1,n)的补图有相同色划分的图,其中T(l1,l2,l3)表示只有一个3度点,三个1度点,且唯一3度点到三个1度点的距离分别为l1,l2,l3的n阶树.
【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).
- 【文献出处】 温州大学学报(自然科学版) ,Journal of Wenzhou University(Natural Sciences) , 编辑部邮箱 ,2007年01期
- 【分类号】O157.5
- 【下载频次】20