设Pn是具有n个顶点的路,Sδ表示有δ=r+1个顶点的星图,把Pn的n个顶点与nSδ的每一个分支的r度顶点依次重迭后得到图PnSδ,运用图的伴随多项式的性质,讨论了图簇PnSδ∪tSδ的伴随多项式的因式分解定理,进而证明了它们的补图的色等价性.
Let Pnbe the path with n vertices and let Sδbe the Star withδ=r+1vertices,the authors denote by PnSδthe graph consisting of Pnand nSδby coinciding each vertex of Pnwith the vertex of degree r of every component of nSδ,respectively,by applying the properties of adjoint polynomials,the authors prove that factorization theorem of adjoint polynomials of a kind of graphs PnSδ∪tSδ,then chromatically equiva-lence of its complements is obtained.