Options
On graphs having no flow roots in the Interval (1, 2)
Citation
Dong, F. M. (2015). On graphs having no flow roots in the Interval (1, 2). Electronic Journal of Combinatorics, 22(1), Article P1.82. http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p82/pdf
Abstract
For any graph G, let W(G) be the set of vertices in G of degrees larger than 3. We show that for any bridgeless graph G, if W(G) is dominated by some component of G-W(G), then F(G,λ ) has no roots in (1; 2), where F(G,λ ) is the flow polynomial of G. This result generalizes the known result that F(G,λ ) has no roots in (1, 2) whenever |W(G)| ≤2. We also give some constructions to generate graphs whose flow polynomials have no roots in (1, 2).
Date Issued
2015
Publisher
Electronic Journal of Combinatorics
Journal
Electronic Journal of Combinatorics