Pages that link to "Item:Q628321"
From MaRDI portal
The following pages link to Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321):
Displaying 12 items.
- Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees (Q327683) (← links)
- Embedding of hypercubes into necklace, windmill and snake graphs (Q436587) (← links)
- Bothway embedding of circulant network into grid (Q491606) (← links)
- Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes (Q2097163) (← links)
- Reliability measure of multiprocessor system based on enhanced hypercubes (Q2217467) (← links)
- Node set optimization problem for complete Josephus cubes (Q2279757) (← links)
- The extra connectivity of the enhanced hypercubes (Q2333806) (← links)
- Embedding of hypercubes into sibling trees (Q2449051) (← links)
- Embedding of recursive circulants into certain necklace graphs (Q2516514) (← links)
- Optimal embedding of hypercube into cylinder (Q2672634) (← links)
- Maximum incomplete recursive circulants in graph embeddings (Q2788730) (← links)
- On some similarity of finite sets (and what we can say today about certain old problem) (Q6199497) (← links)
