Abstract：Assume Pn to be the path with n vertices and Sδ be the Star with δ=r+1 vertices.We use PnδS to denote the graph consisting of Pn and nSδ by coinciding each vertex of Pn with the vertex of degree r of every component of nSδ,respectively.The symbol VS(kn+1)δ is the graph consisting of kPnδS and Sr+k+1 by coinciding a vertex of degree r+1 of each component of kPnδS with k vertices of degree 1 of Sr+k+1.We prove that factorization theorem of adjoint polynomials of a kind of graphs V(kn+1)δSY(k-1)Sδ by applying the properties of adjoint polynomials.Furthermore,we obtain chromatically equivalence of its complements.
郝萃菊； 张秉儒. 一类VλδS形图簇的伴随分解定理及其补图的色等价性[J]. 南昌大学学报（理科版）, 2012, 36(04): 312-.
HAO Cui-ju1,ZHANG Bing-ru2. Adjoint factorization theorem of a kind of graphs of shape VλδS and chromatically equivalence of its complement. , 2012, 36(04): 312-.
2012, Vol. 36 
