Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
On the spanning connectivity and spanning laceability of hypercube-like networks
Theoretical Computer Science
Cycles passing through prescribed edges in a hypercube with some faulty edges
Information Processing Letters
Performance analysis of network operating systems in local area networks
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
The edge-pancyclicity of dual-cube extensive networks
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Edge-bipancyclicity of a hypercube with faulty vertices and edges
Discrete Applied Mathematics
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
Information Processing Letters
A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
Information Processing Letters
Specific attack adjusted Bayesian network for intrusion detection system
MCBC'08 Proceedings of the 9th WSEAS International Conference on Mathematics & Computers In Biology & Chemistry
Graph Theory and Interconnection Networks
Graph Theory and Interconnection Networks
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
On the bipanpositionable bipanconnectedness of hypercubes
Theoretical Computer Science
Operational fault detection in network infrastructure
ICCOM'08 Proceedings of the 12th WSEAS international conference on Communications
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
| Hi-index | 0.00 |
A bipartite graph is hamiltonian laceable if there exists a hamiltonian path between any two vertices that are in different partite sets. A hamiltonian laceable graph G is said to be hyper-hamiltonian laceable if, for any vertex v of G, there exists a hamiltonian path of G - {v} joining any two vertices that are located in the same partite set different from that of v. In this paper, we further improve the hyper-hamiltonian laceability of hypercubes by showing that, for any two vertices x, y from one partite set of Qn, n ≥ 4, and any vertex w from the other partite set, there exists a hamiltonian path H of Qn - {w} joining x to y such that dH(x, z) = l for any vertex z ε V (Qn) - {x,y,w} and for every integer l satisfying both dQn(x, z) ≤ l ≤ 2n - 2 - dQn(z; y) and 2|(l - dQn(x; z)). As a consequence, many attractive properties of hypercubes follow directly from our result.