Pages that link to "Item:Q4420948"
From MaRDI portal
The following pages link to Embedding an arbitrary binary tree into the star graph (Q4420948):
Displaying 13 items.
- Embedding longest fault-free paths onto star graphs with more vertex faults (Q557839) (← links)
- Hyper Hamiltonian laceability on edge fault star graph (Q707305) (← links)
- A study of fault tolerance in star graph (Q846005) (← links)
- Substar reliability analysis in star networks (Q924668) (← links)
- Improving bounds on link failure tolerance of the star graph (Q985078) (← links)
- Path embedding in star graphs (Q1002273) (← links)
- Simulation of binary trees and \(X\)-trees on pyramid networks (Q1309216) (← links)
- Embedding complete binary trees into star and Pancake graphs (Q1387827) (← links)
- Robustness of star graph network under link failure (Q2466079) (← links)
- Cycle embedding in star graphs with edge faults (Q2570761) (← links)
- Congestion-free, dilation-2 embedding of complete binary trees into star graphs (Q4254358) (← links)
- Hamiltonian-laceability of star graphs (Q4761322) (← links)
- Longest fault-free paths in star graphs with vertex faults (Q5958120) (← links)