“…Let from the system digraph G extracted be two disjoint complexes φ k (k = i, j) with T k , H k = (X k ∪ P k , D k ), X k , N k = P k ∪ Q k , where T k is the subdigraph of the complex φ k , H k = (X k ∪ P k , D k ) is the subdigraph from T k homeomorphic to the complete digraph where X k is the set of basic vertices, P k is the set of separating vertices, and D k is the set of arcs [1]. Additionally, let the subdigraph R φ i ↔φ j = G R φ i ↔φ j of the domain of intercomplex exchange T i and T j such that, first,R φ i ↔φ j ∩T i = ∅ andR φ i ↔φ j ∩T j = ∅ and, second, a message from any vertex of T i (T j ) to any vertex of T j (T i ) must follow only a path belonging to the subdigraph G D φ i ↔φ j (T i ∪R φ i ↔φ j ∪T j ) be defined in G. Let us assume that the maximum possible number μ i↔j of faulty vertices belonging to this subdigraph be defined for the subdigraph R φ i ↔φ j .…”