Link Failure Tolerance in the Arrangement Graphs
Kai Feng, Shiying Wang, Guozhen Zhang · International Journal of Foundations of Computer Science · 2015
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].