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...
Saved in:
| 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 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|