Title of article
A zero-free interval for flow polynomials of cubic graphs
Author/Authors
Jackson، نويسنده , , Bill، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
17
From page
127
To page
143
Abstract
Let P ( G , t ) and F ( G , t ) denote the chromatic and flow polynomials of a graph G. Woodall has shown that, if G is a plane triangulation, then the only zeros of P ( G , t ) in ( − ∞ , γ ) are 0, 1 and 2, where γ ≈ 2.54 … is the zero in ( 2 , 3 ) of the chromatic polynomial of the octahedron. The main purpose of this paper is to remove the planarity hypothesis from Woodallʹs theorem by showing that the dual statement holds for both planar and non-planar graphs: if G is a cubic bridgeless graph, then the only zeros of F ( G , t ) in ( − ∞ , γ ) are 1 and 2, where γ ≈ 2.54 … is the zero in ( 2 , 3 ) of the flow polynomial of the cube. Our inductive proof technique forces us to work with near-cubic graphs, that is to say graphs with minimum degree at least two and at most one vertex of degree greater then three. We also obtain related results concerning the zero distribution of the flow polynomials of near-cubic graphs.
Keywords
Chromatic polynomials , Flow polynomials , cubic graphs , Plane triangulations
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2007
Journal title
Journal of Combinatorial Theory Series B
Record number
1527770
Link To Document