Compact graphs and the deterministic algorithm for their synthesis

Compact structures of computational systems are defined as regular graphs with the minimum diameter. A method for synthesis of compact graphs using the representation of the graph by a set of its vertex-complete projections with the minimally possible number of levels is described.