The generalized measure of edge fault tolerance in exchanged crossed cube

Abstract

This work considers the h-edge connectivity to measure the fault tolerance of exchanged crossed cube ECQ(s,t), an attractive variant network of hypercube. We get that the h-edge connectivity of ECQ(s,t) is 2h(s−h+1) if 0≤h≤s−1. It implies that at least 2h(s−h+1) edges have to be removed from ECQ(s,t) to get a disconnected graph that contains no vertices with degree less than h.