Abstract
IN AN INFORMAL WAY, Chap. 1 began the process of both explaining why networks arise in the study of infrastructure and confirming that the spatial organization of infrastructure most generally takes the form of networks. We saw that these networks are conveniently described by mathematical models that have many common features, regardless of the particular technology and decision environment studied. However, a deeper look at infrastructure network models, which is our goal in the balance of this book, requires that we make more precise the definitions, concepts and notation introduced informally in Chap. 1.
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
Notes
- 1.
A general graph (or simply a graph) can contain multiple links between two vertices as well as loops.
- 2.
By unit cost of flow, we mean the cost per unit of flow or average cost of flow:
$$\displaystyle{ c_{ij} = \frac{\text{total cost of flow on link }\left (i,j\right )} {\text{flow on link }\left (i,j\right )}. }$$
3.8 References and Additional Reading
Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms and applications. Englewoord Cliffs, NJ: Prentice-Hall.
Berge, C. (1962). The theory of graphs and its applications. London: Methuen.
Chandrasekaran, R. (1969). Total unimodularity of matrices. SIAM Journal on Applied Mathematics, 11, 1032–1034.
Christofides, N. (1975). Graph theory: An algorithmic approach. New York: Academic.
Dinc, E. A. (1970). Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Mathematics Doklady, 11, 1277–1280.
Edmonds, J., & Johnson, E. (1973). Matching, Euler tours and the Chinese postman problem. Mathematical Programming, 5, 88–124.
Ford, L. R., & Fulkerson, D. R. (1957). A simple algorithm for finding maximal network flows and an application to the Hitchcock problem. Canadian Journal of Mathematics, 9, 210–218.
Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton, NJ: Princeton University Press.
Fulkerson, D. R., & Dantzig, G. B. (1955). Computation of maximal flows in networks. Naval Research Logistics Quarterly, 2, 277–283.
Gondran, M., & Minoux, M. (1984). Graphs and algorithms. New York: John Wiley.
Heller, I. (1957). On linear systems with integral valued solutions. Pacific Journal of Mathematics, 7, 1351–1364.
Hillier, F. S., & Lieberman, G. J. (1955). Introduction to operations research. New York: McGraw Hill.
Heller, I., & Tompkins, C. B. (1956). An extension of a theorem of Dantzig. In H. W. Kuhn, & A. W. Tucker (Eds.), Linear inequalities and related systems (pp. 247–254). Princeton, NJ: Princeton University Press.
Hoffman, A. J., & Heller, I. (1962). On unimodular matrices. Pacific Journal of Mathematics, 12, 1321–1327.
Hoffman, A. J., & Kruskal, J. B. (1958). Integer boundary points of convex polyhedra. In H. W. Kuhn, & A. W. Tucker (Eds.), Linear inequalities and related systems (pp. 223–246). Princeton, NJ: Princeton University Press.
Larson, R. C., & Odoni, A. R. (1981). Urban operations research. Englewood Cliffs, NJ: Prentice-Hall.
Mei-Ko, K. (1952). Graphic programming using odd or even points. Chinese Mathematics, 1(3), 237–277.
Veinott, A. F. (1968). Extreme points of Leontief substitution systems. Linear Algebra Applications, 1, 181–194.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this chapter
Cite this chapter
Friesz, T.L., Bernstein, D. (2016). Elements of Graph Theory. In: Foundations of Network Optimization and Games. Complex Networks and Dynamic Systems, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7594-2_3
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7594-2_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-7593-5
Online ISBN: 978-1-4899-7594-2
eBook Packages: Business and ManagementBusiness and Management (R0)