ISJ Theoretical & Applied Science 12(68) 2018

Philadelphia, USA

Melent'ev, V. A.

Use of Melentiev’s graph representation method for detection of cliques and the analysis of topologies of computing systems.

Full Article: PDF

Scientific Object Identifier: http://s-o-i.org/1.1/TAS-12-68-28

DOI: https://dx.doi.org/10.15863/TAS.2018.12.68.28

Language: Russian

Citation: Melent'ev, V. A. (2018). Use of Melentiev’s graph representation method for detection of cliques and the analysis of topologies of computing systems. ISJ Theoretical & Applied Science, 12 (68), 201-211. Soi: http://s-o-i.org/1.1/TAS-12-68-28 Doi: https://dx.doi.org/10.15863/TAS.2018.12.68.28

Pages: 201-211

Published: 30.12.2018

Abstract: The problem of comparison of the computing systems (CS) topologies is related with finding of maximum cliques in the CS graph. The solution of this task based on using of the representation of the graph offered by the Author is provided in this paper. Properties of projections of the complete graph and projections of cliques of general graph are formulated. The algorithm to identify the maximum clique of the given graph of the computing system and of its modifications corresponding to presented values of indices of reachability and fault-tolerance is described and illustrated by the examples.

Key words: graph's projection, clique graph, reachability of vertexes, topological scalability and topological fault-tolerance of computing systems.