Embedding an arbitrary binary tree into the star graph

DOI10.1109/12.494105zbMath1048.68570OpenAlexW2108423441MaRDI QIDQ4420948

Martin Dowd, Nayla Nassif, Nader Bagherzadeh

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)

Related Items

A study of fault tolerance in star graph, Substar reliability analysis in star networks, Robustness of star graph network under link failure, Hamiltonian-laceability of star graphs, Hyper Hamiltonian laceability on edge fault star graph, Embedding longest fault-free paths onto star graphs with more vertex faults, Improving bounds on link failure tolerance of the star graph, Longest fault-free paths in star graphs with vertex faults, Cycle embedding in star graphs with edge faults