Edge-fault-tolerant pancyclicity of arrangement graphs

The arrangement graph An,kAn,k is a well-known interconnection network. Day and Tripathi proved that An,kAn,k is pancyclic for n-k⩾2n-k⩾2. In this paper, we improve this result, and we demonstrate that An,kAn,k is also pancyclic even if it has no more than (k(n-k)-2)(k(n-k)-2) faulty edges for n-k⩾2n-k⩾2. Our result is optimal concerning the edge fault-tolerance.