Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Cycles in the cube-connected cycles graph
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Graph Theory With Applications
Graph Theory With Applications
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
On the spanning connectivity and spanning laceability of hypercube-like networks
Theoretical Computer Science
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
On the bipanpositionable bipanconnectedness of hypercubes
Theoretical Computer Science
On the enhanced hyper-hamiltonian laceability of hypercubes
CEA'09 Proceedings of the 3rd WSEAS international conference on Computer engineering and applications
Many-to-many n-disjoint path covers in n-dimensional hypercubes
Information Processing Letters
The spanning connectivity of folded hypercubes
Information Sciences: an International Journal
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
Two spanning disjoint paths with required length in generalized hypercubes
Theoretical Computer Science
Disjoint cycles in hypercubes with prescribed vertices in each cycle
Discrete Applied Mathematics
| Hi-index | 0.89 |
Assume that n is a positive integer with n=2. It is proved that between any two different vertices x and y of Q"n there exists a path P"l(x,y) of length l for any l with h(x,y)=