Embedding complete ternary trees into hypercubes

DOI10.7151/DMGT.1420MaRDI QIDQ3633839zbMATH OpenOpenAlexFDO

Authors S. Lavanya, S. A. Choudum

Publication date 23 June 2009

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/75be2871c1be997c3608093279b50cef32edffa4

zbMATH Keywords

complete ternary treesdilationedge congestionembeddinghypercubeinterconnection networknode congestion

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Efficient embeddings of ternary trees into hypercubes.
• Embedding complete binary trees into hypercubes
• Embedding the complete tree in the hypercube
• Embedding complete trees into the hypercube
• On embedding of certain recursive trees and stars into hypercube

Cited in

(9)

• Embedding of \(k\)-ary complete trees into hypercubes with uniform load
• Efficient embeddings of ternary trees into hypercubes.
• Embeddings Between Hypercubes and Hypertrees
• Embedding binary trees into crossed cubes
• Certain AVL subgraphs of ternary cubes
• Embedding a subclass of trees into hypercubes
• Optimal embeddings of generalized ladders into hypercubes
• Embedding complete trees into the hypercube
• Compact embedding of binary trees into hypercubes

This page was built for publication: Embedding complete ternary trees into hypercubes

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