Keyword Search:

Chromatic Equivalence Class of the Join of Certain Tripartite Graphs

Lau, Gee Choon and Peng, Yee Hock (2007) Chromatic Equivalence Class of the Join of Certain Tripartite Graphs. Malaysian Journal of Mathematical Sciences, 1 (1). pp. 103-108. ISSN 1823-8343

[img] PDF
105Kb

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 ≅ 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

Item Type:Article
Keyword:Tripartite graphs, Chromatic polynomial, Chromatic equivalence class
Faculty or Institute:Institute for Mathematical Research
Publisher:UPM Press
ID Code:12562
Deposited By: Najwani Amir Sariffudin
Deposited On:03 Jun 2011 15:14
Last Modified:27 May 2013 15:52

Repository Staff Only: Edit item detail

Document Download Statistics

This item has been downloaded for since 03 Jun 2011 15:14.

View statistics for "Chromatic Equivalence Class of the Join of Certain Tripartite Graphs"