On embedding of certain recursive trees and stars into hypercube

DOI10.1007/978-3-642-36065-7_30MaRDI QIDQ4914460zbMATH OpenOpenAlexFDO

Authors Indhumathi Raman

Publication date 12 April 2013

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36065-7_30

zbMATH Keywords

embeddinghypercuberecursive treesstars

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Embedding complete binary trees into hypercubes
• Embedding the complete tree in the hypercube
• Compact embedding of binary trees into hypercubes
• Dense edge-disjoint embedding of complete binary trees in the hypercube
• Efficient embeddings of ternary trees into hypercubes.

Cited in

(12)

• On embedding subclasses of height-balanced trees in hypercubes
• Embedding height balanced trees and Fibonacci trees in hypercubes
• The starlike trees which span a hypercube
• Efficient embeddings of ternary trees into hypercubes.
• Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
• scientific article; zbMATH DE number 3859148 (Why is no real title available?)
• Embedding complete ternary trees into hypercubes
• Embedding m-quasistars into n-cubes
• scientific article; zbMATH DE number 1983295 (Why is no real title available?)
• Two new classes of trees embeddable into hypercubes
• A counter-example to a lemma about embedding starlike trees into hypercube
• Dense sets and embedding binary trees into hypercubes

This page was built for publication: On embedding of certain recursive trees and stars into hypercube

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