| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10118328 | European Journal of Combinatorics | 2005 | 8 Pages |
Abstract
The flow polynomial FG(k) of a graph G evaluates the number of nowhere-zero A-flows in G for any Abelian group A of order k. Suppose that C is an edge cut of G and G1, G2 are the components of GâC. We give a formula expressing the flow polynomial of G from the flow polynomials of the bridgeless minors of G having edge sets equal either to C, or to E(G1)âªC, or to E(G2)âªC.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Martin Kochol,