On Zero-free Intervals of Flow Polynomials

preprint2014arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.