Abstract
Let X be a graph with an orientation σ and let D be the incidence matrix of X σ. In this chapter we continue the study of how graph-theoretic properties of X are reflected in the algebraic properties of D. As previously, the orientation is merely a device used to prove the results, and the results themselves are independent of which particular orientation is chosen. Let ℝE and ℝv denote the real vector spaces with coordinates indexed by the edges and vertices of X, respectively. Then the column space of D T is a subspace of ℝE, called the cut space of X. The orthogonal complement of this vector space is called the flow space of X.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Bacher, P. de la Harpe, and T. Nagnibeda, The lattice of integral flows and the lattice of integral cuts on a finite graph, Bull. Soc. Math. Prance, 125 (1997), 167–198.
N. Biggs, Algebraic potential theory on graphs, Bull. London Math. Soc., 29 (1997), 641–682.
N. L. Biggs, Chip-firing and the critical group of a graph, J. Algebraic Combin., 9 (1999), 25–45.
A. Björner and L. Lovasz, Chip-firing games on directed graphs, J. Algebraic Combin., 1 (1992), 305–328.
A. Björner, L. Lovász, and P. W. Shor, Chip-firing games on graphs, European J. Combin., 12 (1991), 283–291.
J. Jeffs and S. Seager, The chip firing game onn-cycles, Graphs Combin., 11 (1995), 59–67.
A. L. Larsen, Chip firing games on graphs, Master’s thesis, Technical University of Denmark, 1998.
L. Lovász and P. Winkler, Mixing of random walks and other diffusions on a graph, in Surveys in combinatorics, 1995 (Stirling), Cambridge Univ. Press, Cambridge, 1995, 119–154.
G. Tardos, Polynomial bound for a chip firing game on graphs, SI AM J. Discrete Math., 1 (1988), 397–398.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Godsil, C., Royle, G. (2001). Cuts and Flows. In: Algebraic Graph Theory. Graduate Texts in Mathematics, vol 207. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0163-9_14
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0163-9_14
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95220-8
Online ISBN: 978-1-4613-0163-9
eBook Packages: Springer Book Archive