On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network

DOI10.1016/S0020-0255(00)00021-9zbMath0965.68074OpenAlexW1965423440MaRDI QIDQ1582646

Chiun-Chieh Hsu, Wei-Chen Fang

Publication date: 15 October 2000

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(00)00021-9

zbMATH Keywords

complete binary trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model ⋮ Embedding meshes into twisted-cubes ⋮ The super connectivity of the pancake graphs and the super laceability of the star graphs ⋮ Ring embedding in faulty pancake graphs ⋮ Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs ⋮ Neighbor connectivity of pancake graphs and burnt pancake graphs

Cites Work

• On the embedding of cycles in pancake graphs
• Fault diameter of interconnection networks
• Embedding complete binary trees into hypercubes
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• On Group Graphs and Their Fault Tolerance
• A group-theoretic model for symmetric interconnection networks
• Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
• Near embeddings of hypercubes into Cayley graphs on the symmetric group

This page was built for publication: On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network