Compact structures of computer systems and their synthesis

One of essential issues in computer systems (CS) control is limited decision-making time. Timing of control actions in the process of computer system functioning is in many respects determined by compactness of its structure providing the minimal number of transits at realization of intermodule communications. Compact structures СS are defined as regular graphs of an order n with the minimum diameter. These graphs are compared with $(s,g)$-cage graphs. The method of compact graphs synthesis is suggested. The method is based on the representation of compact graphs by the set of vertex-complete projections with minimally possible number of levels. Examples of $n(s)$-compact graphs built are given.