Chromatic Equivalence And Chromatic Uniqueness Of Some Complete Tripartite Graphs

Let P(G,λ) denote the chromatic polynomial of a simple graph G. Two graphs G and H are said to be chromatically equivalent (in notation: H~G) if P(H,λ) = P(G,λ). The chromatic equivalence class of G, denoted , is defined to be the set of all graphs which have the same chromatic polynomial as G, i.e.,...