On Zero-free Intervals of Flow Polynomials

Abstract

This article studies real roots of the flow polynomial F(G,λ) of a bridgeless graph G. For any integer k 0, let k be the supremum in (1,2] such that F(G,λ) has no real roots in (1,k) for all graphs G with |W(G)| k, where W(G) is the set of vertices in G of degrees larger than 3. We prove that k can be determined by considering a finite set of graphs and show that k=2 for k 2, 3=1.430·s, 4=1.361·s and 5=1.317·s. We also prove that for any bridgeless graph G=(V,E), if all roots of F(G,λ) are real but some of these roots are not in the set \1,2,3\, then |E| |V|+17 and F(G,λ) has at least 9 real roots in (1,2).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…