摘要
本文证明了:当k≥0,n≥4为偶数时,广义轮图θ_(n,k)色多项式唯一。同时,也用较简单的方法证明了:对于一个图G,其色多项式为P_λ(G)=λ…(λ-q+1)·(λ-q)^(n-q)当且仅当G为n阶q-树。
In this paper it is proved that the generalized wheel graph θn,k is chromatically unique if k≥0 and n≥4 is even.Meainwhile, it is also proved that for a graph Gif and only if G is a q-tree on n vertices.
