| T形树－T（1，m，n）的伴随多次式 |
| |
| 引用本文： | 张秉儒.T形树－T（1，m，n）的伴随多次式[J].河北大学学报(自然科学版),1996(4). |
| |
| 作者姓名： | 张秉儒 |
| |
| 作者单位： | 青海教育学院 |
| |
| 摘 要： | 具有度序列（１，１，１，２，２，…，２，３）的树称为Ｔ形树。令Ｔ（ｌ，ｍ，ｎ）表示一棵Ｔ形树，从它的唯一３度点到三个１度点的三条路的长分别为ｌ，ｍ，ｎ，（ｉ≤ｌ≤ｍ≤ｎ），本文给出并证明了Ｔ形树－Ｔ（１，ｍ，ｎ）的伴随多项式的数学表达式
|
| 关 键 词： | 色多项式 T形树 伴随多项式 |
Calculated Formula of Adjoint Polynomials of Tree of T-Shape, T(1,m,n) |
| |
| Zhang Bingru.Calculated Formula of Adjoint Polynomials of Tree of T-Shape, T(1,m,n)[J].Journal of Hebei University (Natural Science Edition),1996(4). |
| |
| Authors: | Zhang Bingru |
| |
| Abstract: | A tree having degree sequence (1,1,1,2,2,…,2,3) is called a tree of T-shape. Let T(l,m,n) denote A tree of T-shape, in which the lengths of the three paths from the only vertex of degree 3 to three vertices of degree 1 are l,m,n respectively, (1≤l≤m≤n), In this paper, by considering the a djoint polynomials of a tree of T-shape, We prove the calculated formula of adjoint polynomials of the tree of T-shape with l=1. |
| |
| Keywords: | Chromatic polynomial Tree of T-Shape Adjoint polynomial |
| 本文献已被 CNKI 等数据库收录！ |
|
