Chromatic Uniqueness of a number of Complete Tripartite Graphs
Zou Hui-wen · Shuxue de shijian yu renshi · 2007
Let G be a simple graph and P(G,λ) denote the chromatic polynomial of G.A graph G is said to be chromatically unique if for any graph H,P(H,λ)=P(G,λ) implies that H is isomorphic to G.Let K(m,n,r) denote a complete tripartite graph,this paper proved that the complete tripartite graph K(m,m,m+k) is chromatically unique if m≥2 and k≥0,K(m,m+1,m+k) is chromatically unique if m≥2 and m+1k≥0.