Area Efficient Layout of Balanced Hypercubes

Two node-disjoint paths in balanced hypercubes

“…It has many variants, such as twisted cube, crossed cube, folded cube, augmented cube, and so on. The balanced hypercube proposed by Huang and Wu [16] is one of the variants of the hypercube. It is bipartite graph and node-transitive [16,26], but has smaller diameter than hypercubes and supports an efficient reconfiguration without changing the adjacent relationship among tasks [26].…”

“…The balanced hypercube proposed by Huang and Wu [16] is one of the variants of the hypercube. It is bipartite graph and node-transitive [16,26], but has smaller diameter than hypercubes and supports an efficient reconfiguration without changing the adjacent relationship among tasks [26]. In recent years, the balanced hypercube has attracted much attention in the literature [16,17,26,29,31,32].…”

Automorphism group of the balanced hypercube

“…As a variant of the hypercube, the balanced hypercube was proposed by Huang and Wu [8] to enhance some properties of the hypercube. An ndimensional balanced hypercube, denoted by BH n , is defined as follows.…”

“…By now, various properties of the balanced hypercube, such as, Hamiltonian laceability, bipanconnectivity, super connectivity etc. have been extensively investigated in the literature [7,8,9,14,16,17,18,19]. In many situations, it is highly desired to use interconnection networks which are highly symmetric.…”

Bipanconnectivity of balanced hypercubes

“…The balanced hypercube is superior to the hypercube in that it has a smaller diameter than that of the hypercube and supports an efficient reconfiguration without changing the adjacent relationship among tasks [21]. More desired properties of balanced hypercubes have been shown in the literature [22,23,21].…”