ON NETWORKS AND BI-COMPLETE GRAPHS,
Abstract
Mathematically, a communication network is a network (bi-complete linear graph) whose edge weights are restricted to be nonnegative. In the physical interpretations which generated this interest, the property which occupies the center of attention is the capacity of the network for supporting a flow from one terminal to another. It is this preoccupation with ''generalized plumbing'' that distinguishes the theory of communication networksother mathematical systems dealing with weighted graphs. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1963
- Accession Number
- AD0418172
Entities
People
- James A. Resh
Organizations
- University of Illinois Urbana–Champaign