Long cycles in hypercubes with optimal number of faulty vertices
From MaRDI portal
Publication:1928522
DOI10.1007/s10878-011-9379-1zbMath1261.90070OpenAlexW2075372248MaRDI QIDQ1928522
Publication date: 3 January 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.197
Related Items
On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube, Hamiltonian cycles in hypercubes with faulty edges, Many-to-many disjoint paths in hypercubes with faulty vertices
Cites Work
- Fault-tolerant cycle embedding in the hypercube
- Gray codes with bounded weights
- Embedding a ring in a hypercube with both faulty links and faulty nodes
- Computational complexity of long paths and cycles in faulty hypercubes
- Long paths and cycles in hypercubes with faulty vertices
- Long paths in hypercubes with a quadratic number of faults
- Longest fault-free paths in hypercubes with vertex faults
- Long paths in hypercubes with conditional node-faults
- Survey on path and cycle embedding in some networks
- Hyper-Hamilton laceable and caterpillar-spannable product graphs