摘要
本文通过研究图的色多项式，及色多项式中系数来证明由ｎ 个顶点，ｎ ＋ ２ 条边（ｎ ≥７） 组成的一类图Ｚｎ 是色惟一的。这类图是从轮图中删去若干条幅而得到的。
According to studying the chromatic polynomial and its coefficients of graphs. We show that a family of graphs which have n notes and n+2 edges(n≥7) are chromatically unique, The graphs in this family can be obtained from the wheel graphs by deleting some of the spoke edges.
出处
《上海第二工业大学学报》
1999年第2期25-30,共6页
Journal of Shanghai Polytechnic University
关键词
色多项式
色等价
色惟一
简单图
轮图
chromatically unique
chromatically equivalent
chromatic polynomial
