scientific article; zbMATH DE number 15656

From MaRDI portal
Publication:3972297





[For the entire collection see Zbl 0705.00015.] Graph theory is proposed for modelling complex interconnection networks arising in the design of very large scale integrated computer systems. The basic theory is given. A previous adaptation of definitions and properties permits to link classic graph results with the networks. The minimization of the hardware-software cost and the maximum lack of communications leads to the use of digraphs for modelling different problems. The analysis of the usefulness of available techniques is developed. The importance of the results due to Kautz and de Bruijn is established. A similar treatment permits to fix the role of minimum path problems. A theorem poses, for certain digraphs, relationships between the minimum degree and the connectivity. A proposition and a corollary are derived from the results of the theorem. Bounds for the diameter of the survival graph of a set of digraphs are deduced.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972297)