Sciweavers

Share
CPC
2004

Two Results on Real Zeros of Chromatic Polynomials

9 years 5 months ago
Two Results on Real Zeros of Chromatic Polynomials
This note presents two results on real zeros of chromatic polynomials. The first result states that if G is a graph containing a q-tree as a spanning subgraph, then the chromatic polynomial P(G, ) of G has no non-integer zeros in the interval (0, q). Sokal conjectured that for any graph G and any real > (G), P(G, ) > 0. Our second result confirms that it is true if (G) n/3 - 1, where n is the order of G.
Feng Ming Dong, Khee Meng Koh
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2004
Where CPC
Authors Feng Ming Dong, Khee Meng Koh
Comments (0)
books