Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs

DOI10.1080/00207160.2012.697557zbMath1255.68040MaRDI 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

zbMATH Keywords

embedding; dilation; hypercubes; generalized Petersen graph; circulant network

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

05C12: Distance in graphs

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Embedding complete multi-partite graphs into Cartesian product of paths and cycles, Bothway embedding of circulant network into grid, A linear time algorithm for embedding hypercube into cylinder and torus, Wirelength of embedding complete multipartite graphs into certain graphs, Matching preclusion and conditional matching preclusion problems for the folded Petersen cube, Embedding of recursive circulants into certain necklace graphs, Maximum incomplete recursive circulants in graph embeddings, Embedding Circulant Networks into Butterfly and Benes Networks, Improved Bound for Dilation of an Embedding onto Circulant Networks

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