Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs
From MaRDI portal
Publication:4306427
DOI10.1017/S0963548300000924zbMath0809.05052OpenAlexW2092907557MaRDI QIDQ4306427
J. W. Essam, David K. Arrowsmith
Publication date: 20 March 1995
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548300000924
Applications of graph theory (05C90) Stochastic network models in operations research (90B15) Percolation (82B43) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- On the enumeration of chains in regular chain-groups
- The coloring of graphs
- The Potts model and flows. I. The pair correlation function
- Percolation theory on directed graphs
- Algebraic Graph Theory
- Extension of the Kasteleyn-Fortuin formulas to directed percolation
- A Contribution to the Theory of Chromatic Polynomials
This page was built for publication: Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs