Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Optimal communication primitives on the generalized hypercube network
Journal of Parallel and Distributed Computing
Highly fault-tolerant routings and fault-induced diameter for generalized hypercube graphs
Journal of Parallel and Distributed Computing
Resource Placement in Torus-Based Networks
IEEE Transactions on Computers
Ring, torus and hypercube architectures/algorithms for parallel computing
Parallel Computing - Special Anniversary issue
Pancyclicity of recursive circulant graphs
Information Processing Letters
Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes
IEEE Transactions on Computers
Uniform Approach for Solving some Classical Problems on a Linear Array
IEEE Transactions on Parallel and Distributed Systems
On Balancing Sorting on a Linear Array
IEEE Transactions on Parallel and Distributed Systems
Hamiltonian properties on the class of hypercube-like networks
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Vertex-pancyclicity of edge-face-total graphs
Discrete Applied Mathematics
Edge-pancyclicity of Möbius cubes
Information Processing Letters
Task assignment in heterogeneous computing systems
Journal of Parallel and Distributed Computing
Node-pancyclicity and edge-pancyclicity of hypercube variants
Information Processing Letters
The m-pancycle-connectivity of a WK-Recursive network
Information Sciences: an International Journal
The pancyclicity and the Hamiltonian-connectivity of the generalized base-b hypercube
Computers and Electrical Engineering
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
Geodesic pancyclicity and balanced pancyclicity of the generalized base-b hypercube
Discrete Applied Mathematics
| Hi-index | 0.00 |
The interconnection network considered in this paper is the generalized base-b hypercube that is an attractive variant of the well-known hypercube. The generalized base-b hypercube is superior to the hypercube in many criteria, such as diameter, connectivity, and fault diameter. In this paper, we study the panconnectivity and pancycle-connectivity of the generalized base-b hypercube. We show that a generalized base-b hypercube is panconnected for b驴3. That is, for each pair of distinct vertices x and y of the n-dimensional generalized base-b hypercube GH(b,n) and for any integer l, where Dist(x,y)驴l驴N驴1, there exists a path of the length l joining x and y, where N is the order of the graph GH(b,n) and Dist(x,y) is the distance between x and y. We also show that a generalized base-b hypercube is pancycle-connected for b驴3. That is, every two distinct vertices x and y of the graph GH(b,n) are contained by a cycle of every length ranging from the length of the smallest cycle that contains x and y to N.