Automatic generation of adequate graphs with given connectivity conditions

A computerized procedure to generate graphs describing a communications network is presented. An initial network description for given connectivity conditions, either to formulate more precise connectivity conditions or to initiate optimization procedures is sought. Conditions related to the minimum rank of network nodes and the minimum number of links between nodes are considered. Both conditions are treated as a function of the Euclidean distance between nodes and the data flow requirements between each pair of nodes. An oriented, symmetrical graph is generated such that with a limited number of links both conditions can be satisfied. Experiments (using Fortran) show that the procedure can produce connected graphs with a small number of links.