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 ≅ G. Chia [4] determined the chromatic equivalence class of the graph...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universiti Putra Malaysia Press
2007
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/12562/1/page_103-108.pdf |
| _version_ | 1796968259124199424 |
|---|---|
| author | Lau, Gee Choon Peng, Yee Hock |
| author_facet | Lau, Gee Choon Peng, Yee Hock |
| author_sort | Lau, Gee Choon |
| collection | UPM |
| description | 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 |
| first_indexed | 2024-03-06T07:25:49Z |
| format | Article |
| id | upm.eprints-12562 |
| institution | Universiti Putra Malaysia |
| language | English |
| last_indexed | 2024-03-06T07:25:49Z |
| publishDate | 2007 |
| publisher | Universiti Putra Malaysia Press |
| record_format | dspace |
| spelling | upm.eprints-125622015-05-27T04:17:17Z http://psasir.upm.edu.my/id/eprint/12562/ Chromatic equivalence class of the join of certain tripartite graphs Lau, Gee Choon Peng, Yee Hock 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 Universiti Putra Malaysia Press 2007 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/12562/1/page_103-108.pdf 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 http://einspem.upm.edu.my/journal/volume1.1.php |
| spellingShingle | Lau, Gee Choon Peng, Yee Hock Chromatic equivalence class of the join of certain tripartite graphs |
| title | Chromatic equivalence class of the join of certain tripartite graphs |
| title_full | Chromatic equivalence class of the join of certain tripartite graphs |
| title_fullStr | Chromatic equivalence class of the join of certain tripartite graphs |
| title_full_unstemmed | Chromatic equivalence class of the join of certain tripartite graphs |
| title_short | Chromatic equivalence class of the join of certain tripartite graphs |
| title_sort | chromatic equivalence class of the join of certain tripartite graphs |
| url | http://psasir.upm.edu.my/id/eprint/12562/1/page_103-108.pdf |
| work_keys_str_mv | AT laugeechoon chromaticequivalenceclassofthejoinofcertaintripartitegraphs AT pengyeehock chromaticequivalenceclassofthejoinofcertaintripartitegraphs |