摘要
用Ｐ＿ｎ表示有ｎ个顶点的路。本文证明了，如果ｑ＞５是素数，则Ｐ＿（ｑ－１）的补图是色唯一的。
Let P(G,)denote the chromatic polynomial of a graph G.Then G is said to bechromatically unique if P(H,)=PG,)implies that H is isomorphic to G.Let P_ndenote the path with n vertices,-G denote the complementary graph of G.In this paper,we prove that the is chromatically unique if q > 5 is prime number.
基金
国家自然科学基金
