摘要
设Ｐ（Ｇ，λ）表示图Ｇ的色多项式．图Ｇ称为色唯一的，如果由可得到．一个广义ｑ－轮是Ｃｎ和Ｋｑ的联图．记作Ｗ（ｎ＋ｑ）．证明了Ｗ（５＋ｑ）和Ｗ（７＋ｑ）不是色唯一的．
Let P(G,λ) denote the chromatic polynomial of a graph G. G is said to be chromatically unique if implies. A generalized q-wheel, denoted by W(n+q), is the join Cn+Kq of Cn and Kn. It is proved that neither W(5+q) nor W(7+q) is chromatically unique.
出处
《上海师范大学学报（自然科学版）》
1996年第1期31-33,共3页
Journal of Shanghai Normal University(Natural Sciences)
关键词
联图
色多项式
色唯一
join
chromatic polynomial
chromatically unique
