Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
From MaRDI portal
Publication:4903481
DOI10.1080/00207160.2012.697557zbMath1255.68040OpenAlexW2011974947MaRDI QIDQ4903481
R. Sundara Rajan, Bharathi Rajan, Indra Rajasingh
Publication date: 22 January 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2012.697557
Network design and communication in computer systems (68M10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
Embedding complete multi-partite graphs into Cartesian product of paths and cycles ⋮ Wirelength of embedding complete multipartite graphs into certain graphs ⋮ Embedding Circulant Networks into Butterfly and Benes Networks ⋮ Embedding Wheel - like Networks ⋮ Improved Bound for Dilation of an Embedding onto Circulant Networks ⋮ Bothway embedding of circulant network into grid ⋮ A linear time algorithm for embedding hypercube into cylinder and torus ⋮ Maximum incomplete recursive circulants in graph embeddings ⋮ Embedding of recursive circulants into certain necklace graphs ⋮ Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding of tori and grids into twisted cubes
- Embedding of meshes in Möbius cubes
- Embedding meshes into locally twisted cubes
- Exact wirelength of hypercubes on a grid
- Embedding ladders and caterpillars into the hypercube
- A Combinatorial Problem Related to Multimodule Memory Organizations
- Embedding complete trees into the hypercube
This page was built for publication: Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs