Ring embedding in faulty pancake graphs
From MaRDI portal
Publication:1007619
DOI10.1016/S0020-0190(02)00510-0zbMATH Open1162.68496MaRDI QIDQ1007619FDOQ1007619
Authors: Chun-Nan Hung, Hong-Chun Hsu, Kao-Yung Liang, Lih-Hsing Hsu
Publication date: 23 March 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
- Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults
- Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
- Fault-tolerant cycle-embedding in alternating group graphs
- Cluster fault-tolerant routing in pancake graphs
- On ring embedding in hypercubes with faulty nodes and links
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Graph theory
- A group-theoretic model for symmetric interconnection networks
- On the embedding of cycles in pancake graphs
- Bounds for sorting by prefix reversal
- On the Diameter of the Pancake Network
- Fault-tolerant Hamiltonicity of twisted cubes
- On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network
- Embedding complete binary trees into star and Pancake graphs
- Fault tolerant routing in the star and pancake interconnection networks
Cited In (18)
- Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks
- Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
- A study for conditional diagnosability of pancake graphs
- The super connectivity of the pancake graphs and the super laceability of the star graphs
- Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
- Cycles in the burnt pancake graph
- Survey on path and cycle embedding in some networks
- Cluster fault-tolerant routing in pancake graphs
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
- Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
- On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network
- Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
- On the global strong resilience of fault Hamiltonian graphs
- Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
- Cubic planar Hamiltonian graphs of various types
- Pancake graphs: structural properties and conditional diagnosability
- Neighbor connectivity of pancake graphs and burnt pancake graphs
This page was built for publication: Ring embedding in faulty pancake graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007619)