Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.disc.2003.12.005
DC FieldValue
dc.titleOn upper bounds for real roots of chromatic polynomials
dc.contributor.authorDong, F.M.
dc.contributor.authorKoh, K.M.
dc.date.accessioned2014-10-28T02:42:11Z
dc.date.available2014-10-28T02:42:11Z
dc.date.issued2004-05-06
dc.identifier.citationDong, F.M., Koh, K.M. (2004-05-06). On upper bounds for real roots of chromatic polynomials. Discrete Mathematics 282 (1-3) : 95-101. ScholarBank@NUS Repository. https://doi.org/10.1016/j.disc.2003.12.005
dc.identifier.issn0012365X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/103851
dc.description.abstractFor any positive integer n, let script G sign n denote the set of simple graphs of order n. For any graph G in script G sign n, let P(G,λ) denote its chromatic polynomial. In this paper, we first show that if G ∈ script G signn and χ(G)≤n-3, then P(G,λ) is zero-free in the interval (n-4+β/6-2/β,+∞), where β=(108+12√93)1/3 and β/6-2/β (=0.682327804...) is the only real root of x3+x-1; we proceed to prove that whenever n-6≤χ(G)≤n-2, P(G,λ) is zero-free in the interval (⌈(n+χ(G))/2⌉-2,+∞). Some related conjectures are also proposed. © 2003 Elsevier B.V. All rights reserved.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.disc.2003.12.005
dc.sourceScopus
dc.subjectChromatic polynomial
dc.subjectRoot
dc.subjectSimplicial vertex
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1016/j.disc.2003.12.005
dc.description.sourcetitleDiscrete Mathematics
dc.description.volume282
dc.description.issue1-3
dc.description.page95-101
dc.description.codenDSMHA
dc.identifier.isiut000221634100010
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.