Hamiltonian Cycles with Prescribed Edges in Hypercubes
SIAM Journal on Discrete Mathematics
Graph Theory With Applications
Graph Theory With Applications
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Cycles passing through prescribed edges in a hypercube with some faulty edges
Information Processing Letters
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Sciences: an International Journal
Edge-bipancyclicity of conditional faulty hypercubes
Information Processing Letters
The two-equal-disjoint path cover problem of Matching Composition Network
Information Processing Letters
A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
Information Processing Letters
Information Processing Letters
The bipancycle-connectivity of the hypercube
Information Sciences: an International Journal
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
SIAM Journal on Discrete Mathematics
Edge-fault-tolerant bipanconnectivity of hypercubes
Information Sciences: an International Journal
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
IEEE Transactions on Computers
On path bipancyclicity of hypercubes
Information Processing Letters
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links
Information Sciences: an International Journal
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
Information Processing Letters
The triangular pyramid: Routing and topological properties
Information Sciences: an International Journal
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
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
Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
Information Sciences: an International Journal
Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
Information Processing Letters
Independent spanning trees on even networks
Information Sciences: an International Journal
A note on cycle embedding in hypercubes with faulty vertices
Information Processing Letters
Disjoint path covers in recursive circulants G(2m,4) with faulty elements
Theoretical Computer Science
Paired many-to-many disjoint path covers of hypercubes with faulty edges
Information Processing Letters
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
Theoretical Computer Science
Paired many-to-many disjoint path covers of the hypercubes
Information Sciences: an International Journal
Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
Information Sciences: an International Journal
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
Single-source three-disjoint path covers in cubes of connected graphs
Information Processing Letters
Paired many-to-many disjoint path covers in faulty hypercubes
Theoretical Computer Science
Research note: An efficient construction of one-to-many node-disjoint paths in folded hypercubes
Journal of Parallel and Distributed Computing
| Hi-index | 0.08 |
This paper considers the problem of many-to-many disjoint paths in the hypercube Q"n with f"v faulty vertices and f"e faulty edges, and obtains the following result. For any integer k with 1=