Embedding Hamiltonian cycles into folded hypercubes with faulty links

DOI10.1006/JPDC.2000.1681zbMATH Open1010.68675OpenAlexW2080885331MaRDI QIDQ1862467FDOQ1862467

Dajin Wang

Publication date: 19 March 2003

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.2000.1681

Recommendations

• scientific article; zbMATH DE number 6139910
• Fault-tolerant cycles embedding in folded hypercubes
• A further result on fault-free cycles in faulty folded hypercubes
• Path Embedding on Folded Hypercubes
• Hamiltonian cycle embeddings in faulty hypercubes under the forbidden faulty set model

zbMATH Keywords

embeddingHamiltonian cyclefault tolerancefolded hypercubelink fault

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)

Cited In (36)

• Title not available (Why is that?)
• Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes
• Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes
• Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults
• Embeddings of Hamiltonian paths in faulty \(k\)-ary 2-cubes
• The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
• 1-vertex-fault-tolerant cycles embedding on folded hypercubes
• Survey on path and cycle embedding in some networks
• A further result on fault-free cycles in faulty folded hypercubes
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
• Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
• EMBEDDING HAMILTONIAN CYCLES, LINEAR ARRAYS AND RINGS IN A FAULTY SUPERCUBE
• Cycle embedding of augmented cubes
• Strong Menger connectivity with conditional faults of folded hypercubes
• Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults
• Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices
• On conditional diagnosability of the folded hypercubes
• Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant
• Embedding of the folded hypercubes into tori
• Cycles embedding on folded hypercubes with faulty nodes
• Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
• Cycles in folded hypercubes
• Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
• On reliability of the folded hypercubes
• Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle
• The spanning connectivity of folded hypercubes
• Embedding a fault-free Hamiltonian cycle in a class of faulty generalized honeycomb tori
• Odd cycles embedding on folded hypercubes with conditional faulty edges
• Spectra analysis and network coherence for weighted folded hypercube
• Cycles embedding in folded hypercubes with conditionally faulty vertices
• A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes
• A note on embeddings among folded hypercubes, even graphs and odd graphs
• Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes
• Vertex-fault-tolerant cycles embedding on enhanced hypercube networks
• Cycles embedding in folded hypercubes under the conditional fault model

This page was built for publication: Embedding Hamiltonian cycles into folded hypercubes with faulty links

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1862467)