Some Properties of the Balanced Hypercube.

As a variant of Q n , Huang and Wu in [IEEE Transactions on Computers 46 (1997) 484–490] introduced the balanced hypercube B H n as an interconnection network topology for computing systems. In this paper, we show that B H n is a lexicographic product of two graphs, and using this, we show that every minimum cyclic vertex-cut of B H n isolates a 4-cycle, and prove that the edge neighbor connectivity of B H n is 2 n. [ABSTRACT FROM AUTHOR]