Summary
A “two-dimensional network”G b is here defined as an extension of an ordinary network (of the Graph Theory), whose arcs have an associate given direction, i.e. a vectorb ofR 2 such that ¦b¦2=1.
Some concepts of the Graph Theory are extended toG b and the path-flow decomposition of a flow onG b is given, using the concept of bi-dimensional path.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. Prager, Mathematical Programming and Theory of Structures,J. Soc. Indust. Appl. Math., vol.13, no. 1, March 1965, pp. 312–332.
W. S. Dorn, H. J. Greenberg, Linear Programming and Plastic Limit Analysis of Structures,Quarterly of Appl. Math.,15 (1957) pp. 155–167.
L. R. Ford, D. R. Fulkerson,Flows in Networks, Princeton Univ. Press, Princeton, N.J., 1962.
S. Timoshenko, D. H. Young,Engineering Mechanics, McGraw-Hill Book Company, New York, 1951.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Borreani, A. Flows on two-dimensional networks. J Eng Math 3, 209–217 (1969). https://doi.org/10.1007/BF01535169
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01535169