Pages that link to "Item:Q4903481"
From MaRDI portal
The following pages link to Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs (Q4903481):
Displaying 13 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)
- A linear time algorithm for embedding hypercube into cylinder and torus (Q2015139) (← links)
- Wirelength of embedding complete multipartite graphs into certain graphs (Q2181259) (← links)
- On embedding of a hypercube in a completely overlapping network (Q2272202) (← links)
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube (Q2344732) (← links)
- Embedding of recursive circulants into certain necklace graphs (Q2516514) (← links)
- Maximum incomplete recursive circulants in graph embeddings (Q2788730) (← links)
- Embedding Circulant Networks into Butterfly and Benes Networks (Q2946066) (← links)
- Improved Bound for Dilation of an Embedding onto Circulant Networks (Q3296854) (← links)
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles (Q5061707) (← links)
- Embedding Wheel - like Networks (Q6187747) (← links)
