Communications of the ACM - Special section on computer architecture
Topological Properties of Hypercubes
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Edge-pancyclic block-intersection graphs
Discrete Mathematics - Special volume: Designs and Graphs
The vulnerability of the diameter of folded n-cubes
Proceedings of the international conference on Combinatorics '94
Resource Placement in Torus-Based Networks
IEEE Transactions on Computers
Efficient generation of the binary reflected gray code and its applications
Communications of the ACM
Embedding Hamiltonian cycles into folded hypercubes with faulty links
Journal of Parallel and Distributed Computing
Pancyclicity of recursive circulant graphs
Information Processing Letters
Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes
IEEE Transactions on Computers
Embedding Graphs onto the Supercube
IEEE Transactions on Computers
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
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
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Hamiltonian properties on the class of hypercube-like networks
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Task assignment in heterogeneous computing systems
Journal of Parallel and Distributed Computing
Fault-free cycles in folded hypercubes with more faulty elements
Information Processing Letters
Fault-tolerant embedding of paths in crossed cubes
Theoretical Computer Science
On the bipanpositionable bipanconnectedness of hypercubes
Theoretical Computer Science
Some results on topological properties of folded hypercubes
Information Processing Letters
Strongly Hamiltonian laceability of the even k-ary n-cube
Computers and Electrical Engineering
The panpositionable panconnectedness of augmented cubes
Information Sciences: an International Journal
Bipanconnectivity of balanced hypercubes
Computers & Mathematics with Applications
Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
Discrete Applied Mathematics
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
Discrete Applied Mathematics
Panconnectivity of n-dimensional torus networks with faulty vertices and edges
Discrete Applied Mathematics
Research note: An efficient construction of one-to-many node-disjoint paths in folded hypercubes
Journal of Parallel and Distributed Computing
| Hi-index | 5.23 |
The interconnection network considered in this paper is the folded hypercube that is an attractive variance of the well-known hypercube. The folded hypercube is superior to the hypercube in many criteria, such as diameter, connectivity and fault diameter. In this paper, we study the path embedding aspects, bipanconnectivity and m-panconnectivity, of the n-dimensional folded hypercube. A bipartite graph is bipanconnected if each pair of vertices x and y are joined by the bipanconnected paths that include a path of each length s satisfying and is even, where N is the number of vertices, and denotes the shortest distance between x and y. A graph is m-panconnected if each pair of vertices x and y are joined by the paths that include a path of each length ranging from m to N-1. In this paper, we introduce a new graph called the Path-of-Ladders. By presenting algorithms to embed the Path-of-Ladders into the folded hypercube, we show that the n-dimensional folded hypercube is bipanconnected for n is an odd number. We also show that the n-dimensional folded hypercube is strictly (n-1)-panconnected for n is an even number. That is, each pair of vertices are joined by the paths that include a path of each length ranging from n-1 to N-1; and the value n-1 reaches the lower bound of the problem.