Embedding an arbitrary binary tree into the star graph

DOI10.1109/12.494105MaRDI QIDQ4420948zbMATH OpenOpenAlexFDO

Authors Nader Bagherzadeh, Martin Dowd, N. Nassif

Publication date 1996

Published in IEEE Transactions on Computers (Search for Journal in Brave)

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

zbMATH Keywords

interconnection networktree partitioning

Mathematics Subject Classification ID

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

Recommendations

• Embedding complete binary trees into star networks
• Embedding complete binary trees into star and Pancake graphs
• Congestion-free, dilation-2 embedding of complete binary trees into star graphs
• scientific article; zbMATH DE number 3945345
• On embedding graphs in trees
• Path embedding in star graphs
• Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
• Embedding double starlike trees into hypercubes

Cited in

(14)

• Path embedding in star graphs
• Simulation of binary trees and X-trees on pyramid networks
• Embedding complete binary trees into star and Pancake graphs
• Robustness of star graph network under link failure
• Cycle embedding in star graphs with edge faults
• Congestion-free, dilation-2 embedding of complete binary trees into star graphs
• Hamiltonian-laceability of star graphs
• Embedding complete binary trees into star networks
• Embedding longest fault-free paths onto star graphs with more vertex faults
• Longest fault-free paths in star graphs with vertex faults
• Hyper Hamiltonian laceability on edge fault star graph
• A study of fault tolerance in star graph
• Substar reliability analysis in star networks
• Improving bounds on link failure tolerance of the star graph

This page was built for publication: Embedding an arbitrary binary tree into the star graph

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