Embedding complete binary trees into star and Pancake graphs
From MaRDI portal
Publication:1387827
DOI10.1007/S002240000089zbMath0896.68108OpenAlexW2054028598MaRDI QIDQ1387827
Publication date: 8 June 1998
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002240000089
Related Items (5)
Embedding complete binary trees into star networks ⋮ Minimum average congestion of enhanced and augmented hypercubes into complete binary trees ⋮ Largest connected component of a star graph with faulty vertices ⋮ The super connectivity of the pancake graphs and the super laceability of the star graphs ⋮ Ring embedding in faulty pancake graphs
This page was built for publication: Embedding complete binary trees into star and Pancake graphs
