Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Communication algorithms in k-ary n-cube interconnection networks
Information Processing Letters
Resource Placement in Torus-Based Networks
IEEE Transactions on Computers
Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes
IEEE Transactions on Computers
Lee Distance and Topological Properties of k-ary n-cubes
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
Hamiltonian-like Properties of k-Ary n-Cubes
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
Journal of Parallel and Distributed Computing
The bipanconnectivity and m-panconnectivity of the folded hypercube
Theoretical Computer Science
The m-pancycle-connectivity of a WK-Recursive network
Information Sciences: an International Journal
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
Mutually independent Hamiltonian cycles in k-ary n-cubes when k is odd
AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics
Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges
Information Sciences: an International Journal
Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even
Computers and Electrical Engineering
Hamiltonian cycles passing through linear forests in k-ary n-cubes
Discrete Applied Mathematics
One-to-one disjoint path covers on k-ary n-cubes
Theoretical Computer Science
Pancyclicity of k-ary n-cube networks with faulty vertices and edges
Discrete Applied Mathematics
Panconnectivity of n-dimensional torus networks with faulty vertices and edges
Discrete Applied Mathematics
Hamiltonian path embeddings in conditional faulty k-ary n-cubes
Information Sciences: an International Journal
| Hi-index | 0.00 |
The interconnection network considered in this paper is the k-ary n-cube that is an attractive variance of the well-known hypercube. Many interconnection networks can be viewed as the subclasses of the k-ary n-cubes include the cycle, the torus and the hypercube. A bipartite graph is Hamiltonian laceable if there exists a Hamiltonian path joining every two vertices which are in distinct partite sets. A bipartite graph G is strongly Hamiltonian laceable if it is Hamiltonian laceable and there exists a path of length N - 2 joining each pair of vertices in the same partite set, where N=|V(G)|. We prove that the k-ary n-cube is strongly Hamiltonian laceable for k is even and n=2.