摘要
文献[4]中引入了伴随多项式的概念来讨论图的色性.由于伴随多项式系数的特点,决定了它的根具有特殊性.用Pn表示有n个顶点的路.Dn表示把三角形的一个顶点与Pn-2的一个一度顶点重迭后得到的图.本文获得了Dn补图的伴随多项式的根的若干性质,并利用这些性质得到了一个引理,它在Dn补图的色唯一性证明中具有重要意义.
The notion of adjoint polynomials of graphs was introduced for Chromaticity research by Lui Ru - Ying in [4]. Since the characteristic of its coefficient, adjoint polynomials foots has some specific property. In this paper, the minimum roots of the adjoint polynomials of complements of Dn is discussed, and some important results are obtained. These results have critical significance for solving the chromatic uniqueness of complements of Dn.
出处
《青海师专学报》
2005年第6期12-15,共4页
Journal of Qinghai Junior Teachers' College
基金
国家自然科学基金资助项目(10061003)
关键词
伴随多项式
最小根
色唯一
Adjoint polynomial
Minimum root
Chromaticallg uniqueness
