| 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 Pn denote the path with n vertices,-G denote the complementary graph of G.In this paper,we prove that the Pq－1 is chromatically unique if q > 5 is prime number. |
