arXiv Analytics

Sign in

arXiv:1403.1916 [math.CO]AbstractReferencesReviewsResources

On Zero-free Intervals of Flow Polynomials

Fengming Dong

Published 2014-03-08Version 1

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

Comments: 26 pages, 7 figures
Categories: math.CO
Subjects: 05C15
Related articles: Most relevant | Search more
arXiv:2007.05195 [math.CO] (Published 2020-07-10)
A survey on the study of real zeros of flow polynomials
arXiv:1812.01814 [math.CO] (Published 2018-12-05)
Zero-free intervals of chromatic polynomials of mixed hypergraphs
arXiv:1109.2769 [math.CO] (Published 2011-09-13, updated 2011-10-13)
Upper bound for the rainbow connection number of bridgeless graphs with diameter 3