A Remark on Chromatically Unique 5-Partite Graphs

Let P(G, λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H ,i f P(G, λ )= P(H, λ). We write [G ]= {H|H ∼ G} .I f [G ]= {G}, then G is said to be chromatically unique. In this paper, two new families of chromatically unique complete 5-partite graphs G having 5n+4 vertices with certain star or matching deleted are obtained. Mathematics Subject Classification: 05C15