Chromatic Uniqneness of Complementary Graphs of Pq-1
Received:December 15, 1991  
Key Words:   
Fund Project:
Author NameAffiliation
Liu Ruying Dept. of Maht.
Qinghai Normal University
Hits: 1767
Download times: 1224
      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.
View Full Text  View/Add Comment  Download reader