Channel graphs of bit permutation networks
Channel graphs have been widely used in the study of blocking networks. In this paper, we show that a bit pen-nutation network has a unique channel graph if and only if it is connected, and two connected bit pen-nutation networks are isomorphic if and only if their channel graphs are isomorphic. (C) 2001 Elsevier Science B.V. All rights reserved.
channel graph multistage interconnection network switching network