Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults

DOI10.1016/j.dam.2013.12.025zbMath1288.05147OpenAlexW2030375751MaRDI QIDQ2449066

Xiang-Feng Pan, Huiqing Liu, Xiaolan Hu

Publication date: 6 May 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.12.025

zbMATH Keywords

interconnection networkHamilton cycleedge-fault-toleranceburnt pancake graphconditional faulty network

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15) Eulerian and Hamiltonian graphs (05C45)

Related Items

Odd cycles embedding on folded hypercubes with conditional faulty edges ⋮ Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model ⋮ Hamiltonicity of the Torus Network Under the Conditional Fault Model

Cites Work

• Unnamed Item
• Fault-tolerant routing in burnt pancake graphs
• Bounds for sorting by prefix reversal
• On the problem of sorting burnt pancakes
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Fault tolerant routing in the star and pancake interconnection networks
• Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
• The (conditional) matching preclusion for burnt pancake graphs
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• A group-theoretic model for symmetric interconnection networks
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry