A graph theoretical approach to equivalence of multistage interconnection networks

AbstractWe consider multistage interconnection networks for designed communication in multi-processor architecture. We give a graph characterization of these networks and a set of properties which imply that a network is topologically equivalent to the Baseline network. In particular our characterization proves that the six classical multistage interconnection networks are topologically equivalent