Link Failure Tolerance in the Arrangement Graphs

Abstract

The arrangement graph An,k is one of the attractive underlying topologies for distributed systems. Let fm(n, k) be the minimum number of faulty links that make every sub-arrangement graph An-m,k-m faulty in An,k under link failure model. In this paper, we proved that [Formula: see text], [Formula: see text], and [Formula: see text] for [Formula: see text].