Bounds for the coefficients of flow polynomials (Q875944): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2006.07.005 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2065944804 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Zeros of chromatic and flow polynomials of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tension-flow polynomials on graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition of the flow polynomial / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nowhere-zero 6-flows / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4795883 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Contribution to the Theory of Chromatic Polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3216652 / rank | |||
Normal rank |
Latest revision as of 17:25, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bounds for the coefficients of flow polynomials |
scientific article |
Statements
Bounds for the coefficients of flow polynomials (English)
0 references
16 April 2007
0 references
Let \(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)\in \{(t-1)^{2},(t-1)(t-2\}\) if \(m=n+1\). It is shown that if \(m\geq n+2\), then the absolute value of the coefficient of \(t^{i}\) in the expansion of \(F(G,t)\) is bounded above by the coefficient of \(t^{i}\) in the expansion of \( (t+1)(t+2)(t+3)(t+4)^{m-n-2}\) for each \(i\) with \(0\leq i\leq m-n+1\).
0 references
near-cubic graph
0 references
cubic graph
0 references
contraction
0 references
subdivision
0 references