Publication: Chromatic equivalence classes of complete tripartite graphs
dc.citedby | 12 | |
dc.contributor.author | Chia G.L. | en_US |
dc.contributor.author | Ho C.-K. | en_US |
dc.contributor.authorid | 55914572800 | en_US |
dc.contributor.authorid | 7404653303 | en_US |
dc.date.accessioned | 2023-12-29T07:54:37Z | |
dc.date.available | 2023-12-29T07:54:37Z | |
dc.date.issued | 2009 | |
dc.description.abstract | Some necessary conditions on a graph which has the same chromatic polynomial as the complete tripartite graph Km, n, r are developed. Using these, we obtain the chromatic equivalence classes for Km, n, n (where 1 ? m ? n) and Km1, m2, m3 (where | mi - mj | ? 3). In particular, it is shown that (i) Km, n, n (where 2 ? m ? n) and (ii) Km1, m2, m3 (where | mi - mj | ? 3, 2 ? mi, i = 1, 2, 3) are uniquely determined by their chromatic polynomials. The result (i), proved earlier by Liu et�al. [R.Y. Liu, H.X. Zhao, C.Y. Ye, A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs, Discrete Math. 289 (2004) 175-179], answers a conjecture (raised in [G.L. Chia, B.H. Goh, K.M. Koh, The chromaticity of some families of complete tripartite graphs (In Honour of Prof. Roberto W. Frucht), Sci. Ser. A (1988) 27-37 (special issue)]) in the affirmative, while result (ii) extends a result of Zou�[H.W. Zou, On the chromatic uniqueness of complete tripartite graphs Kn1, n2, n3 J. Systems Sci. Math. Sci. 20 (2000) 181-186]. � 2008 Elsevier B.V. All rights reserved. | en_US |
dc.description.nature | Final | en_US |
dc.identifier.doi | 10.1016/j.disc.2007.12.059 | |
dc.identifier.epage | 143 | |
dc.identifier.issue | 1 | |
dc.identifier.scopus | 2-s2.0-56349129702 | |
dc.identifier.spage | 134 | |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-56349129702&doi=10.1016%2fj.disc.2007.12.059&partnerID=40&md5=68fe14dd988ed9be62455a294cc9b01c | |
dc.identifier.uri | https://irepository.uniten.edu.my/handle/123456789/30850 | |
dc.identifier.volume | 309 | |
dc.pagecount | 9 | |
dc.relation.ispartof | All Open Access; Bronze Open Access | |
dc.source | Scopus | |
dc.sourcetitle | Discrete Mathematics | |
dc.subject | Chromatic polynomials | |
dc.subject | Chromatic uniqueness | |
dc.subject | Complete tripartite graphs | |
dc.subject | Equivalence classes | |
dc.subject | Polynomial approximation | |
dc.subject | Polynomials | |
dc.subject | Set theory | |
dc.subject | Chromatic polynomials | |
dc.subject | Chromatic uniqueness | |
dc.subject | Complete solutions | |
dc.subject | Complete tripartite graphs | |
dc.subject | Graph theory | |
dc.title | Chromatic equivalence classes of complete tripartite graphs | en_US |
dc.type | Article | en_US |
dspace.entity.type | Publication |