Embedding of hypercubes into banana trees

MaRDI QIDQ3452043zbMATH OpenFDO

Authors Jasintha Quadras, S. Sarah Surya

Publication date 18 November 2015

zbMATH Keywords

congestion lemmapartition lemma

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Parallel algorithms in computer science (68W10)

Recommendations

• Embeddings Between Hypercubes and Hypertrees
• Incomplete hypercubes: Embeddings of tree-related networks
• Graph embedding and interconnection networks
• Embedding large complete binary trees in hypercubes with load balancing
• Embedding of hypercubes into necklace, windmill and snake graphs

Cited in

(4)

• Graph embedding and interconnection networks
• Embedding complete multipartite graphs into certain trees
• Embedding augmented cube into certain trees and windmill graphs
• Optimization of layout for embedding complete k-partite graphs into line graphs of certain tree architectures

This page was built for publication: Embedding of hypercubes into banana trees

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