Embeddings Between Hypercubes and Hypertrees
From MaRDI portal
Recommendations
- Embedding a subclass of trees into hypercubes
- Embedding complete trees into the hypercube
- Embedding of hypercubes into sibling trees
- Embedding complete binary trees into hypercubes
- Efficient Embeddings of Trees in Hypercubes
- Embedding the complete tree in the hypercube
- Two new classes of trees embeddable into hypercubes
- A note on embedding hypertrees
- Embedding complete ternary trees into hypercubes
Cited in
(16)- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
- Wirelength of hypercubes into certain trees
- Incomplete hypercubes: Embeddings of tree-related networks
- Embedding of hypercubes into sibling trees
- Embedding of hypercubes into generalized books.
- Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
- Wirelength of enhanced hypercubes into r-rooted complete binary trees
- Embedding of hypercubes into banana trees
- scientific article; zbMATH DE number 165468 (Why is no real title available?)
- Graph embedding and interconnection networks
- An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
- Embedding a subclass of trees into hypercubes
- Minimum Linear Arrangement of Generalized Sierpinski Graphs
- Embedding augmented cube into certain trees and windmill graphs
- Embedding of hypercube into fractal cubic network
- Optimization of layout for embedding complete k-partite graphs into line graphs of certain tree architectures
This page was built for publication: Embeddings Between Hypercubes and Hypertrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196315)
