Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fault-Tolerant Ring Embedding in de Bruijn Networks
IEEE Transactions on Computers
The Balanced Hypercube: A Cube-Based System for Fault-Tolerant Applications
IEEE Transactions on Computers
Parallel computation: models and methods
Parallel computation: models and methods
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions
IEEE Transactions on Computers
Constructing Edge-Disjoint Spanning Trees in Product Networks
IEEE Transactions on Parallel and Distributed Systems
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed Computing
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
Journal of Parallel and Distributed Computing
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
The bipanconnectivity and m-panconnectivity of the folded hypercube
Theoretical Computer Science
Edge-fault-tolerant bipanconnectivity of hypercubes
Information Sciences: an International Journal
Bipanconnectivity and Bipancyclicity in k-ary n-cubes
IEEE Transactions on Parallel and Distributed Systems
Conditional Edge-Fault Hamiltonicity of Matching Composition Networks
IEEE Transactions on Parallel and Distributed Systems
Paths in Möbius cubes and crossed cubes
Information Processing Letters
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
SIAM Journal on Discrete Mathematics
Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes
IEEE Transactions on Computers
Matching preclusion for balanced hypercubes
Theoretical Computer Science
Conditional diagnosability of balanced hypercubes under the PMC model
Information Sciences: an International Journal
Conditional diagnosability of balanced hypercubes under the MM∗ model
The Journal of Supercomputing
| Hi-index | 0.09 |
The balanced hypercube, proposed by Wu and Huang, is a variant of the hypercube network. In this paper, paths of various lengths are embedded into balanced hypercubes. A bipartite graph G is bipanconnected if, for two arbitrary nodes x and y of G with distance d(x,y), there exists a path of length l between x and y for every integer l with d(x,y)@?l@?|V(G)|-1 and l-d(x,y)=0 (mod 2). We prove that the n-dimensional balanced hypercube BH"n is bipanconnected for all n=1. This result is stronger than that obtained by Xu et al. which shows that the balanced hypercube is edge-bipancyclic and Hamiltonian laceable.