Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4656768 | Journal of Combinatorial Theory, Series B | 2015 | 20 Pages |
Abstract
For any integer kâ¥0, let ξk be the supremum in (1,2] such that the flow polynomial F(G,λ) has no real roots in (1,ξk) for all graphs G with at most k vertices 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â¯â, ξ4=1.361⯠and ξ5=1.317â¯â.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
F.M. Dong,