Chromatic Equivalence Class of the Join of Certain Tripartite Graphs

For a simple graph g, let p(g;λ) be the chromatic polynomial of g. two graphs g and h are said to be chromatically equivalent, denoted g ~ h if p(g;λ) = p(h;λ). a graph g is said to be chromatically unique, if h ~ g implies that h cong g. chia [4] determined the chromatic equivalence class of the graph consisting of the join of p copies of the path each of length 3. in this paper, we determined the chromatic equivalence class of the graph consisting of the join of p copies of the complete tripartite graph k1,2,3. msc: 05c15;05c60