Practical classification topological structures of communication networks for multiprocessor computer systems

Abstract

Proposed by the working version of practical classification topological structures of communication networks for multiprocessor computer systems. Any n-dimensional non-full mesh structure presented here as the result of some operations on any basic graph of the set, including one-dimensional non-full mesh simple graphs and n-dimensional realization of the generalized full mesh structure. The main classification criterion, which was refined earlier, is the notion of dimension topological structure that eliminates the shortcomings and contradictions of the, well-known, authors such classifications.