摘要
讨论了形如（Ｄｍｌ∪…∪Ｄｍｋ）∪（Ｐｎｌ∪…∪Ｐｎｌ）以及（Ｄｍｌ∪…∪Ｄｍｋ）∪（Ｃｎｌ∪…∪Ｃｎｔ）的两类图的补图的色性，并证明了，在一定的限制条件下，它们是色唯一图．
As usual,P. and Cn denote path and cycle of order n, respectively. Let D. be the graph obtained by identifying a vertex of K3 with a 1-degree vertex of Pn-2. In the present article,the coloring of two classes of graphs and are investigated, and their chromatical unique ness under certain conditions is proved.
出处
《内蒙古大学学报（自然科学版）》
CAS
CSCD
1996年第1期11-17,共7页
Journal of Inner Mongolia University：Natural Science Edition
基金
国家自然科学基金
关键词
色多项式
伴随多项式
色唯一图
chromatic polynomial associate polynomial chromatically unique graph
