Many-to-many disjoint paths in faulty hypercubes
Author:
- 1 August 2009
- journal article
- Published by Elsevier in Information Sciences
- Vol. 179 (18) , 3110-3115
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- On path bipancyclicity of hypercubesInformation Processing Letters, 2009
- Long paths in hypercubes with conditional node-faultsInformation Sciences, 2009
- Edge-fault-tolerant bipanconnectivity of hypercubes☆Information Sciences, 2009
- The bipancycle-connectivity of the hypercubeInformation Sciences, 2008
- Path partitions of hypercubesInformation Processing Letters, 2008
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edgesInformation Processing Letters, 2008
- The two-equal-disjoint path cover problem of Matching Composition NetworkInformation Processing Letters, 2008
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubesInformation Sciences, 2007
- Cycles passing through prescribed edges in a hypercube with some faulty edgesInformation Processing Letters, 2007
- Spanning multi-paths in hypercubesDiscrete Mathematics, 2007