Abstract
We obtain new necessary conditions on a graph which shares the same chromatic polynomial as that of the complete tripartite graph Km,n,r. Using these, we establish the chromatic equivalence classes for K1,n,n+1 (where n ≥ 2). This gives a partial solution to a question raised earlier by the authors. With the same technique, we further show that Kn-3,n,n+1 is chromatically unique if n ≥ 5. In the more general situation, we show that if 2 ≤ m ≥ n, then Km,n,n+1 is chromatically unique if n is sufficiently large.
| Original language | English |
|---|---|
| Pages (from-to) | 641-646 |
| Number of pages | 6 |
| Journal | Bulletin of the Malaysian Mathematical Sciences Society |
| Volume | 37 |
| Issue number | 3 |
| Publication status | Published - 2014 |
| Externally published | Yes |
Keywords
- Chromatic equivalence class
- Chromatic polynomial
- Complete tripartite graph
Fingerprint
Dive into the research topics of 'Chromatic equivalence classes of some families of complete tripartite graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver