scientific article
From MaRDI portal
Publication:4000490
zbMath0752.00063MaRDI QIDQ4000490
No author found.
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Collections of reprinted articles (00B60)
Related Items
Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes ⋮ Node-to-set disjoint paths problem in star graphs ⋮ An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs ⋮ Node-to-node cluster fault tolerant routing in star graphs ⋮ Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three ⋮ Bus interconnection networks ⋮ Edge-bipancyclicity of star graphs with faulty elements ⋮ Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes ⋮ Cycles embedding in folded hypercubes with conditionally faulty vertices ⋮ 1-vertex-fault-tolerant cycles embedding on folded hypercubes ⋮ Embedding longest fault-free paths onto star graphs with more vertex faults ⋮ A further result on fault-free cycles in faulty folded hypercubes ⋮ Cycle embedding of augmented cubes ⋮ Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults ⋮ Fault-tolerant routing in circulant networks and cycle prefix networks
