Complete binary trees in folded and enhanced cubes

DOI10.1002/NET.20002MaRDI QIDQ4474302zbMATH OpenOpenAlexFDO

Authors R. Usha Nandini, S. A. Choudum

Publication date 4 August 2004

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20002

zbMATH Keywords

binary treeembeddingenhanced cubefolded cubegraphhypercubenetwork

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1472115
• Embedding complete binary trees into hypercubes
• Optimal dynamic embeddings of complete binary trees into hypercubes
• Compact embedding of binary trees into hypercubes
• Embedding the complete tree in the hypercube

Cited in

(13)

• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Wirelength of hypercubes into certain trees
• Wirelength of embedding complete multipartite graphs into certain graphs
• The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
• Fault-tolerant cycles embedding in folded hypercubes
• scientific article; zbMATH DE number 1472115 (Why is no real title available?)
• Embedding complete multi-partite graphs into Cartesian product of paths and cycles
• scientific article; zbMATH DE number 5171238 (Why is no real title available?)
• Vertex-fault-tolerant cycles embedding on enhanced hypercube networks
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• Set-to-set disjoint paths in a folded hypercube
• Complete binary trees embeddings in Möbius cubes
• Some results on topological properties of folded hypercubes

This page was built for publication: Complete binary trees in folded and enhanced cubes

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