Title of article
Chromatic Equivalence Class of the Join of Certain Tripartite Graphs
Author/Authors
Lau, G.C. Universiti Teknologi MARA (Johor Branch) - Faculty of I T and Quantitative Science, Malaysia , Lau, G.C. Universiti Putra Malaysia - Institute for Mathematical Research, Malaysia , Peng, Y.H. Universiti Putra Malaysia - Institute for Mathematical Research - Department of Mathematics, Malaysia
From page
103
To page
108
Abstract
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
Keywords
Tripartite graphs , Chromatic polynomial , Chromatic equivalence class
Journal title
Malaysian Journal of Mathematical Sciences
Journal title
Malaysian Journal of Mathematical Sciences
Record number
2571378
Link To Document