Skip to main navigation Skip to search Skip to main content

Chromatic equivalence classes of some families of complete tripartite graphs

  • University of Malaya
  • Sunway University

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

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 languageEnglish
Pages (from-to)641-646
Number of pages6
JournalBulletin of the Malaysian Mathematical Sciences Society
Volume37
Issue number3
Publication statusPublished - 2014
Externally publishedYes

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