Pq－1的补图的色唯一性

Chromatic Uniqneness of Complementary Graphs of Pq－1

中文关键词:  图  色多项式  色唯一图。

中文摘要:

      用Ｐ_n表示有ｎ个顶点的路。本文证明了，如果ｑ＞５是素数，则Ｐ_q－1的补图是色唯一的。

英文摘要:

      Let P(G,λ)denote the chromatic polynomial of a graph G.Then G is said to bechromatically unique if P(H,λ)=P(G,λ)implies that H is isomorphic to G.Let P_n denote the path with n vertices,-G denote the complementary graph of G.In this paper,we prove that the P_q－1 is chromatically unique if q > 5 is prime number.