The following pages link to Embeddings of circulant networks (Q358657):
Displaying 17 items.
- Embedding of hypercubes into necklace, windmill and snake graphs (Q436587) (← links)
- Bothway embedding of circulant network into grid (Q491606) (← links)
- The embedding of rings and meshes into \(\text{RP} (k)\) networks (Q866115) (← links)
- Survey on path and cycle embedding in some networks (Q1042541) (← links)
- The cyclic wirelength of trees (Q1270789) (← links)
- Minimum layout of circulant graphs into certain height balanced trees (Q1683534) (← links)
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees (Q1751113) (← links)
- Layout of random circulant graphs (Q1794318) (← links)
- Characterization of the congestion lemma on layout computation (Q2051622) (← links)
- Node set optimization problem for complete Josephus cubes (Q2279757) (← links)
- Embedding of hypercubes into sibling trees (Q2449051) (← links)
- Embedding of recursive circulants into certain necklace graphs (Q2516514) (← links)
- Maximum incomplete recursive circulants in graph embeddings (Q2788730) (← links)
- Inducing Measures by Cyclic Networks (Q3158195) (← links)
- Network Comparison: Embeddings and Interiors (Q4621551) (← links)
- A note on minimum linear arrangement for BC graphs (Q4634526) (← links)
- On linear layout of bicube and construction of optimal incomplete bicube (Q6130207) (← links)
