Mapping Cycles and Trees on Wrap-Around Butterfly Graphs
From MaRDI portal
Publication:5470712
DOI10.1137/S0097539799365462zbMath1095.68004OpenAlexW2132688634MaRDI QIDQ5470712
Meghanad D. Wagh, Osman Guzide
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539799365462
Network design and communication in computer systems (68M10) Paths and cycles (05C38) Mathematical problems of computer architecture (68M07) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (7)
Embedding meshes into crossed cubes ⋮ Path embeddings in faulty 3-ary \(n\)-cubes ⋮ Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements ⋮ Embedding of meshes in Möbius cubes ⋮ Edge-pancyclicity and path-embeddability of bijective connection graphs ⋮ Embedding of tori and grids into twisted cubes ⋮ Fault-Tolerant Panconnectivity of Augmented Cubes AQn
This page was built for publication: Mapping Cycles and Trees on Wrap-Around Butterfly Graphs
