ABOUT TOPOLOGICAL COMPACTNESS OF COMPUTING SYSTEMS

The problem of synthesis of topology of a computer system is solved as a problem of constructing a graph with a minimum diameter for given values of the order, degree and girth of the graph. The solution is based on the use of projective graph description and it is reduced to creation of a joint (in respect of the above characteristics) set of its vertex-complete projections. The concept of a compact graph is given, its analytical model is presented. A algorithm for generation compact graphs, which is based on this model, is described.