Mapping Cycles and Trees on Wrap-Around Butterfly Graphs

DOI10.1137/S0097539799365462MaRDI QIDQ5470712zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

butterfly graphscyclesfinite fieldmappingmathematical modeltrees

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph representations (geometric and intersection representations, etc.) (05C62) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

Recommendations

• Optimal emulations by butterfly-like networks
• Regular layouts of butterfly networks
• Cyclic-cubes and wrap-around butterflies
• Optimal embeddings of butterfly-like graphs in the hypercube
• Cycles in butterfly graphs

Cited in

(14)

• Reduction of network cost and wiring in Ranade's butterfly routing
• On the bisection width and expansion of butterfly networks
• Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance
• Embedding meshes into crossed cubes
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Some characterizations for the wrapped butterfly
• Cycle embedding in faulty wrapped butterfly graphs
• Algebraic specification of interconnection network relationships by permutation voltage graph mappings
• Cycles in butterfly graphs
• Fault-Tolerant Panconnectivity of Augmented Cubes AQn
• Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
• Embedding of tori and grids into twisted cubes
• Path embeddings in faulty 3-ary \(n\)-cubes
• Embedding of meshes in Möbius cubes

This page was built for publication: Mapping Cycles and Trees on Wrap-Around Butterfly Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470712)