In the paper computing networks and media which can be described as structures with common data links connecting a number of computers (nodes) are considered. In order to describe such structures a generalization of the notion of a graph is introduced and called network. The network \(G=(X,Y,A)\) consists of two limited size sets: X is the set of nodes and Y is the set of buses. A is a matrix whose element \(a_{ij}\) is 1 if node i is connected with bus j, and \(a_{ij}=0\) otherwise. Multiple connections are not permitted. It is shown that for every network G there exists a one-to-one mapping to a dual graph called bigraph. Investigation of this graph gives the possibility to obtain all topological properties of the original network.
Author defines network homogeneity, gives network classification, and considers networks with maximum reliability.