Optimal embeddings of generalized ladders into hypercubes
From MaRDI portal
Publication:5936018
DOI10.1016/S0012-365X(00)00227-2zbMath0986.05034OpenAlexW2042456687MaRDI QIDQ5936018
Publication date: 27 February 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00227-2
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (15)
Spanning multi-paths in hypercubes ⋮ Embeddings of circulant networks ⋮ Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees ⋮ Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength ⋮ Minimum average congestion of enhanced and augmented hypercubes into complete binary trees ⋮ Embedding Wheel - like Networks ⋮ Embedding of hypercubes into necklace, windmill and snake graphs ⋮ Embedding of hypercubes into sibling trees ⋮ Bothway embedding of circulant network into grid ⋮ Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees ⋮ Wirelength of hypercubes into certain trees ⋮ Embedding a subclass of trees into hypercubes ⋮ A linear time algorithm for embedding hypercube into cylinder and torus ⋮ Exact wirelength of hypercubes on a grid ⋮ On the balanced domination of graphs
This page was built for publication: Optimal embeddings of generalized ladders into hypercubes
