
AbstractLet G be any connected bridgeless (n,m)-graph which may have loops and multiedges. It is known that the flow polynomial F(G,t) of G is a polynomial of degree m−n+1; F(G,t)=t−1 if m=n; and F(G,t)∈{(t−1)2,(t−1)(t−2)} if m=n+1. This paper shows that if m⩾n+2, then the absolute value of the coefficient of ti in the expansion of F(G,t) is bounded above by the coefficient of ti in the expansion of (t+1)(t+2)(t+3)(t+4)m−n−2 for each i with 0⩽i⩽m−n+1.
Flow polynomial, Contraction, Computational Theory and Mathematics, Near-cubic graph, Subdivision, Discrete Mathematics and Combinatorics, Cubic graph, 004, 510, Theoretical Computer Science
Flow polynomial, Contraction, Computational Theory and Mathematics, Near-cubic graph, Subdivision, Discrete Mathematics and Combinatorics, Cubic graph, 004, 510, Theoretical Computer Science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
